An interactive broadcasting protocol for video-on-demand

Broadcasting protocols reduce the cost of video-on-demand services by distributing more efficiently videos that are likely to be simultaneously watched by several viewers. Unfortunately, they do not allow the customer to pause, move fast forward or backward while watching a video. We present an interactive pagoda broadcasting protocol that provides these functions at a very reasonable cost. Our protocol is based on the pagoda broadcasting protocol and requires a set-top box buffer large enough to keep in storage all video data until the customer has watched the entire video. As a result, rewind and pause interactions do not require any server intervention. To minimize the bandwidth requirements of fast forward interactions, the server only transmits the segments that are not available on any of the server broadcasting channels. We evaluate the overhead of these fast forward operations through a probabilistic model. Our data indicate that the most costly fast forward operations are those starting at the beginning of the video and jumping to the beginning of the second half of the video while most fast-forward operation taking place during the second half of the video require little or no additional data.

[1]  Eric Wing Ming Wong,et al.  Performance Model of Interactive Video-on-Demand Systems , 1996, IEEE J. Sel. Areas Commun..

[2]  J. Wong,et al.  Broadcast Delivery , 1988, Proc. IEEE.

[3]  W.-F. Poon,et al.  Design and analysis of multicast delivery to provide VCR functionality in video-on-demand systems , 1999, 1999 2nd International Conference on ATM. ICATM'99 (Cat. No.99EX284).

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

[5]  Li-Ming Tseng,et al.  Fast data broadcasting and receiving scheme for popular video service , 1998, IEEE Trans. Broadcast..

[6]  Darrell D. E. Long,et al.  Hybrid broadcasting protocol for video on demand , 1998, Electronic Imaging.

[7]  Noriaki Kamiyama,et al.  An efficient deterministic bandwidth allocation method in interactive video-on-demand systems , 1998, IEEE GLOBECOM 1998 (Cat. NO. 98CH36250).

[8]  Darrell D. E. Long,et al.  Video-on-demand broadcasting protocols , 2001 .

[9]  Darrell D. E. Long,et al.  An efficient implementation of interactive video-on-demand , 2000, Proceedings 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.PR00728).

[10]  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..

[11]  Jehan-François Pâris A simple low-bandwidth broadcasting protocol for video-on-demand , 1999, Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370).

[12]  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.

[13]  Li-Ming Tseng,et al.  Harmonic broadcasting for video-on-demand service , 1997, IEEE Trans. Broadcast..

[14]  Wanjiun Liao,et al.  Synchronization of distributed multimedia systems with user interactions , 1998, Multimedia Systems.

[15]  Darrell D. E. Long,et al.  Efficient broadcasting protocols for video on demand , 1998, Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247).

[16]  Yu-Chee Tseng,et al.  A recursive frequency-splitting scheme for broadcasting hot videos in VOD service , 2000, IEEE Trans. Commun..

[17]  Kien A. Hua,et al.  Skyscraper broadcasting: a new broadcasting scheme for metropolitan video-on-demand systems , 1997, SIGCOMM '97.

[18]  Wanjiun Liao,et al.  The Split and Merge Protocol for Interactive Video-on-Demand , 1997, IEEE Multim..

[19]  Wanjiun Liao,et al.  The split and merge (SAM) protocol for interactive video-on-demand systems , 1997, Proceedings of INFOCOM '97.