Fast broadcasting for hot video access

Using multiple channels to broadcast a popular video can reduce the viewer's waiting time. With the same bandwidth allocation as conventional broadcasting schemes, pyramid broadcasting schemes can provide users with shorter waiting time. This paper presents a new broadcasting method, which can reduce the user's waiting time much greater than previous schemes. With the same waiting requirement for a popular movie, the new algorithm needs much less bandwidth and, thus, greatly saves the bandwidth requirements. At the client end, the buffer requirement is in between previous pyramid schemes. However, using the new scheme, if a set-top box has no buffer, its user can still have the movie with longer waiting time, but previous pyramid schemes cannot provide continuous video service without buffer.

[1]  Tomasz Imielinski,et al.  Metropolitan area video-on-demand service using pyramid broadcasting , 1996, Multimedia Systems.

[2]  Philip S. Yu,et al.  A permutation-based pyramid broadcasting scheme for video-on-demand systems , 1996, Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems.

[3]  Tzi-cker Chiueh,et al.  Periodic broadcasting approach to video-on-demand service , 1996, Other Conferences.

[4]  Kevin C. Almeroth,et al.  The Use of Multicast Delivery to Provide a Scalable and Interactive Video-on-Demand Service , 1996, IEEE J. Sel. Areas Commun..