Competitive Analysis of On-line Stream Merging Algorithms

A popular approach to reduce the server bandwidth in a video-on-demand system is to merge the streams initiated at different times. In recent years, a number of on-line algorithms for stream merging have been proposed; the objective is to minimize either the total bandwidth or the maximum bandwidth over all time. The performance of these algorithms was better understood with respect to the first objective. In particular, the connector algorithm [9] is known to be O(1)- competitive, and the dyadic algorithm [12] is known to have an almost tight bounds on its average total bandwidth requirement. For minimizing maximum bandwidth, existing results are limited to empirical studies only and no algorithm has been known to be competitive. The main contribution of this paper is the first competitive analysis of the connector and the dyadic algorithms with respect to the maximum bandwidth, showing that both algorithms are 4-competitive. We also give a worstcase analysis of the dyadic algorithm with respect to the total bandwidth, revealing that the dyadic algorithm can be tuned to be 3-competitive.

[1]  Prudence W. H. Wong,et al.  A unified analysis of hot video schedulers , 2002, STOC '02.

[2]  Richard E. Ladner,et al.  Comparison of stream merging algorithms for media-on-demand , 2003, Multimedia Systems.

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

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

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

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

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

[8]  Philip S. Yu,et al.  On optimal batching policies for video-on-demand storage servers , 1996, Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems.

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

[10]  Tzi-cker Chiueh,et al.  Periodic broadcasting approach to video-on-demand service , 1996, Other Conferences.

[11]  Predrag R. Jelenkovic,et al.  The Dyadic Stream Merging Algorithm , 2002, J. Algorithms.

[12]  Prudence W. H. Wong,et al.  On-line stream merging in a general setting , 2003, Theor. Comput. Sci..

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

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

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

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

[17]  Richard E. Ladner,et al.  Competitive on-line stream merging algorithms for media-on-demand , 2001, SODA '01.

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

[19]  Darrell D. E. Long,et al.  Improving Bandwidth Efficiency of Video-on-Demand Servers , 1999, Comput. Networks.