Minimizing average waiting time in video-on-demand broadcasting

The waiting time for given bandwidth is considered as one of the most important performance metrics of video-on-demand broadcasting schemes. It is known that, if the available bandwidth is c times the display rate of a video, then 1/(ec -1) is the tight lower bound on the maximum waiting time normalized by the video duration. The best general lower bound on the normalized average waiting time known to date is 1/(4ec-1). We first derive the tight lower bound on the average waiting time for fixed start-points schemes, which is almost exactly 1/(1.123ec -1). We then introduce the Harmonic Block Windows scheme, and show that the average waiting time of Harmonic Block Windows schedules asymptotically approaches the tight lower bound.

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

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

[3]  Richard E. Ladner,et al.  Windows scheduling problems for broadcast systems , 2002, SODA '02.

[4]  Peter van Beek,et al.  On the design of efficient video-on-demand broadcast schedules , 1999, MASCOTS '99. Proceedings of the Seventh International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

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

[6]  Richard E. Ladner,et al.  A general buffer scheme for the windows scheduling problem , 2009, JEAL.

[7]  Jehan-François Pâris.  A fixed-delay broadcasting protocol for video-on-demand , 2001, Proceedings Tenth International Conference on Computer Communications and Networks (Cat. No.01EX495).

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

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

[10]  Madhu Sudan,et al.  Harmonic broadcasting is bandwidth‐optimal assuming constant bit rate , 2006, Networks.

[11]  Richard E. Ladner,et al.  Scheduling Techniques for Media-on-Demand , 2003, SODA '03.

[12]  Tomasz Imielinski,et al.  Pyramid broadcasting for video-on-demand service , 1995, Electronic Imaging.

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

[14]  David G. Kirkpatrick,et al.  Lower bounds on average-case delay for video-on-demand broadcast protocols , 2007, SODA '07.

[15]  Zhiwen Lin.  NEAR-OPTIMAL HEURISTIC SOLUTIONS FOR TRUNCATED HARMONIC WINDOWS SCHEDULING AND HARMONIC GROUP WINDOWS SCHEDULING , 2004 .

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