By Topic

Channel folding - an algorithm to improve efficiency of multicast video-on-demand systems

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

1 Author(s)
Lee, J.Y.B. ; Dept. of Inf. Eng., Chinese Univ. of Hong Kong, China

Recently a number of researchers have proposed and investigated new video-on-demand architectures that make use of network multicast to achieve vastly improved efficiency. Techniques such as batching, patching, periodic broadcasting, chaining, and piggybacking have been explored both in isolation and in combinations. This study investigates a new tool in the arsenal-channel folding, where aggressive client-side caching is used to merge clients from one multicast channel into the other. In particular, this channel folding algorithm is applied to a previously proposed unified video-on-demand (UVoD)) architecture to demonstrate and to quantify its impact on the performance and the tradeoff in a multicast video distribution architecture. This paper presents this channel folding algorithm in the context of UVoD) and derives a performance model to obtain the system latency, the near-optimal channel partition policy, and the client buffer requirement. Numerical results show that channel folding can double the capacity of UVoD) with a remarkably small overhead in the client buffer requirement.

Published in:

Multimedia, IEEE Transactions on  (Volume:7 ,  Issue: 2 )