By Topic

A new patching channel schedule scheme for video multicast

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
$31 $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

2 Author(s)
Dongliang Guan ; Inst. of Image Commun. & Inf. Process., Shanghai Jiao Tong Univ., China ; Songyu Yu

A new patching schedule scheme for video multicast is proposed The response to requests is modeled as a renewal process, and we prove that there exists an optimal value for the renewal period; in addition, a searching approach is presented to find this optimal value. The successive requests in a period are divided into a set of groups, based on which the patching streams are further patched in each group. Simulation results show that the proposed patching scheme outperforms the conventional patching technique by a significant margin in reducing the server network-I/O bandwidth. It even performs better than the dynamic skyscraper algorithm over a wide range of client request rates. Furthermore, it is reasonably competitive with hierarchical multicast stream merging (HMSM) at low to modest client request rates. Most importantly, the implementation complexity of our algorithm is much lower than the skyscraper and HMSM.

Published in:

Consumer Electronics, IEEE Transactions on  (Volume:49 ,  Issue: 2 )