Optimal and efficient merging schedules for video-on-demand servers

The simplest video-on-demand (VOD) delivery policy is to allocate a new media delivery stream to each client request when it arrives. This policy has the desirable properties of “immediate service” (there is minimal latency between the client request and the start of playback, assuming that sufficient server bandwidth is available to start the new stream), of placing minimal demands on client capabilities (the client receive bandwidth required is the media playback rate, and no client local storage is required), and of being simple to implement. However, the policy is untenable because it requires server bandwidth that scales linearly with the number of clients that must be supported simultaneously, which is too expensive for many applications.

[1]  Mary K. Vernon,et al.  Dynamic Skyscraper Broadcasts for Video-on-Demand , 1998, Multimedia Information Systems.

[2]  C S LuiJohn,et al.  Reducing I/O demand in video-on-demand storage servers , 1995 .

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

[4]  Philip S. Yu,et al.  On optimal piggyback merging policies for video-on-demand systems , 1996, SIGMETRICS '96.

[5]  John C. S. Lui,et al.  Reducing I/O demand in video-on-demand storage servers , 1995, SIGMETRICS '95/PERFORMANCE '95.

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

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

[8]  Ying Cai,et al.  Optimizing patching performance , 1998, Electronic Imaging.