The Dyadic Stream Merging Algorithm

We study the stream merging problem for media-on-demand servers. Clients requesting media from the server arrive by a Poisson process, and delivery to the clients starts immediately. Clients are prepared to receive up to two streams at any time, one or both being fed into a buffer cache. We present an on-line algorithm, the dyadic stream merging algorithm, whose recursive structure allows us to derive a tight asymptotic bound on stream merging performance. In particular, let ? be the Poisson request arrival rate, and let L be the fixed media length. Then the long-time ratio of the expected total stream length under the dyadic algorithm to that under an algorithm with no merging is asymptotically equal to 3log(?L)2?L. Furthermore, we establish the near-optimality of the dyadic algorithm by comparisons with experimental results obtained for an optimal algorithm constructed as a dynamic program. The dyadic algorithm and the best on-line algorithm of those recently proposed differ by less than a percent in their comparison with an off-line optimal algorithm. Finally, the worst-case performance of our algorithm is shown to be no worse than that of earlier algorithms. Thus, the dyadic algorithm appears to be the first near optimal algorithm that admits a rigorous average-case analysis.

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

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

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

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

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

[6]  Li-Ming Tseng,et al.  Enhanced harmonic data broadcasting and receiving scheme for popular video service , 1998 .

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

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

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

[10]  Kien A. Hua,et al.  Exploiting client bandwidth for more efficient video broadcast , 1998, Proceedings 7th International Conference on Computer Communications and Networks (Cat. No.98EX226).

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

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

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

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

[15]  Li-Ming Tseng,et al.  Staircase data broadcasting and receiving scheme for hot video service , 1997 .

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

[17]  Darrell D. E. Long,et al.  A low bandwidth broadcasting protocol for video on demand , 1998, Proceedings 7th International Conference on Computer Communications and Networks (Cat. No.98EX226).

[18]  Gerald W. Neufeld,et al.  Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication , 1997, SIGCOMM 1998.

[19]  Darrell D. E. Long,et al.  LIMITING THE CLIENT BANDWIDTH OF BROADCASTING PROTOCOLS FOR VIDEOS ON DEMAND , 2000 .

[20]  Keith W. Ross,et al.  Computer networking - a top-down approach featuring the internet , 2000 .

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

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

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

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

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

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

[27]  Li-Ming Tseng,et al.  Fast data broadcasting and receiving scheme for popular video service , 1998, IEEE Trans. Broadcast..

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

[29]  Li-Ming Tseng,et al.  Fast broadcasting for hot video access , 1997, Proceedings Fourth International Workshop on Real-Time Computing Systems and Applications.

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

[31]  Lixin Gao,et al.  Frame-based periodic broadcast and fundamental resource tradeoffs , 2001, Conference Proceedings of the 2001 IEEE International Performance, Computing, and Communications Conference (Cat. No.01CH37210).

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

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