On-line advancement of transmission plans in video-on-demand

We detail an algorithm for the transmission of video-on-demand, which allows transmissions to be advanced dynamically when there is enough bandwidth. The effect is a transmission speed-up and consequently the freeing of bandwidth reservations in the future. This freed bandwidth can therefore be used by other transmissions. We evaluate two basic criteria for producing these advancements, and also detail how this scheme can be combined with other existing on-demand transmission methods. In our experiments we have combined it with an implementation of patching. We compare the performance of our algorithm with this model, and also with a system without merging taken as a reference. We demonstrate that, during the high audience period, delays resulting from our approach are about 44 % lower than without advancements, and we also state the importance of the criteria used for these advancements.

[1]  Peter Triantafillou,et al.  Video placement and configuration of distributed video servers on cable TV networks , 2000, Multimedia Systems.

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

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

[4]  Kevin C. Almeroth,et al.  Long term resource allocation in video delivery systems , 1997, Proceedings of INFOCOM '97.

[5]  Paul Sampson,et al.  Diamond project: Video-on-demand system, and trials , 1997, Eur. Trans. Telecommun..

[6]  Vicent Cholvi,et al.  Simulations on Batching in Video-on-Demand Transmissions , 2003, International Conference on Computational Science.

[7]  Vicent Cholvi,et al.  Placement of storage capacity in distributed video servers , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[8]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

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

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

[11]  John C. S. Lui,et al.  Merging video streams in a multimedia storage server: complexity and heuristics , 1998, Multimedia Systems.