By Topic

BroadCatch: a periodic broadcast technique for heterogeneous video-on-demand

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
M. A. Tantaoui ; Sch. of Comput. Sci., Univ. of Central Florida, Orlando, FL, USA ; K. A. Hua ; T. T. Do

Many essential multimedia applications rely on video-on-demand technology to deliver a video to different users. A number of periodic broadcast techniques have been proposed for the cost-effective implementation of such systems. Most of these techniques would either try to minimize the server bandwidth, user bandwidth, user storage, user access latency to the video, or a combination of some of the aforementioned parameters. On the other hand, the implementation strategies of these broadcast schemes would necessitate a minimum bandwidth requirement for all users. Multi-resolution techniques address the heterogeneity problem by sacrificing user video quality. In this paper, we consider a different approach that does not possess this disadvantage. Using an incremental channel design at the server side, and a specific broadcast schedule, users can choose among a range of bandwidths to use to download the video at the cost of their access latency and not to the video quality. We prove the correctness of the proposed solution; provide mathematical analysis to demonstrate its heterogeneous behavior, and present performance studies to illustrate its efficiency.

Published in:

IEEE Transactions on Broadcasting  (Volume:50 ,  Issue: 3 )