Bandwidth skimming: a technique for cost-effective video on demand

This paper proposes a new technique for on-demand delivery of streaming media. The idea is to hold in reserve, or `skim', a portion of the client reception bandwidth that is sufficiently small that display quality is not impacted significantly, and yet that is nonetheless enough to support substantial reductions in server and network bandwidth through near-optimal hierarchical client stream merging. In this paper we show that this objective is feasible, and we develop practical techniques that achieve it. The results indicate that server and network bandwidth can be reduced to on the order of the logarithm of the number of clients who are viewing the object, using a small `skim' (e.g., 15%) of client reception bandwidth. These low server and network bandwidths are achieved for every media file, while providing immediate service to each client, and without having to pre-load initial portions of the video at each client.

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

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

[3]  Lixin Gao,et al.  Optimal Patching Schemes for Efficient Multimedia Streaming , 1999 .

[4]  Sally Floyd,et al.  Wide area traffic: the failure of Poisson modeling , 1995, TNET.

[5]  Kien A. Hua,et al.  An efficient bandwidth-sharing technique for true video on demand systems , 1999, MULTIMEDIA '99.

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

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

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

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

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

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

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

[14]  Darrell D. E. Long,et al.  Zero-delay broadcasting protocols for video-on-demand , 1999, MULTIMEDIA '99.

[15]  Asit Dan,et al.  Scheduling policies for an on-demand video server with batching , 1994, MULTIMEDIA '94.

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

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

[18]  Mary K. Vernon,et al.  Optimized regional caching for on-demand data delivery , 1998, Electronic Imaging.

[19]  Donald F. Towsley,et al.  Catching and selective catching: efficient latency reduction techniques for delivering continuous multimedia streams , 1999, MULTIMEDIA '99.

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