Scalable on-demand streaming of nonlinear media

A conventional video file contains a single temporally-ordered sequence of video frames. Clients requesting on-demand streaming of such a file receive (all or intervals of) the same content. For popular tiles that receive many requests during a file playback time, scalable streaming protocols based on multicast or broadcast have been devised. Such protocols require server and network bandwidth that grow much slower than linearly with the file request rate. This paper considers "nonlinear" video content in which there are parallel sequences of frames. Clients dynamically select which branch of the video they wish to follow, sufficiently ahead of each branch point so as to allow the video to he delivered without jitter. An example might be "choose-your-own-ending" movies. With traditional scalable delivery architectures such as movie theaters or TV broadcasting, such personalization of the delivered video content is very difficult or impossible. It becomes feasible, in principle at least, when the video is streamed to individual clients over a network. This paper analyzes the minimal server bandwidth requirements, and proposes and evaluates practical scalable delivery protocols, for on-demand streaming of nonlinear media

[1]  Jehan-François Pâris,et al.  A BROADCASTING PROTOCOL FOR COMPRESSED VIDEO , 1999 .

[2]  Mary K. Vernon,et al.  Bandwidth skimming: a technique for cost-effective video on demand , 1999, Electronic Imaging.

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

[4]  Mary K. Vernon,et al.  Optimal and efficient merging schedules for video-on-demand servers , 1999, MULTIMEDIA '99.

[5]  Donald F. Towsley,et al.  Efficient schemes for broadcasting popular videos , 2002, Multimedia Systems.

[6]  Mary K. Vernon,et al.  Network bandwidth requirements for scalable on-demand streaming , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[7]  Lixin Gao,et al.  Frame-based periodic broadcast and fundamental resource tradeoffs , 2001, Conference Proceedings of the 2001 IEEE International Performance, Computing, and Communications Conference (Cat. No.01CH37210).

[8]  Darrell D. E. Long,et al.  Improving video-on-demand server efficiency through stream tapping , 1997, Proceedings of Sixth International Conference on Computer Communications and Networks.

[9]  Ailan Hu,et al.  Video-on-demand broadcasting protocols: a comprehensive study , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

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

[11]  Yitzhak Birk,et al.  Tailored transmissions for efficient near-video-on-demand service , 1999, Proceedings IEEE International Conference on Multimedia Computing and Systems.

[12]  Donald F. Towsley,et al.  Supplying instantaneous video-on-demand services using controlled multicast , 1999, Proceedings IEEE International Conference on Multimedia Computing and Systems.

[13]  Mary K. Vernon,et al.  Efficient delivery techniques for variable-bit-rate multimedia , 2001, IS&T/SPIE Electronic Imaging.

[14]  Mary K. Vernon,et al.  Scalable on-demand media streaming with packet loss recovery , 2001, TNET.

[15]  Fulu Li,et al.  An inherently loss-less and bandwidth-efficient periodic broadcast scheme for VBR video (poster session) , 2000, SIGMETRICS '00.

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

[17]  Mary K. Vernon,et al.  Minimizing Bandwidth Requirements for On-Demand Data Delivery , 2001, IEEE Trans. Knowl. Data Eng..

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