Abstract
Stream merging is a promising technique for reducing server bandwidth in video-on-demand systems. There are many heuristics for the problem proposed whose effectiveness has been confirmed empirically. However, it is desirable to prove their effectiveness mathematically. In the pioneering work [2], Bar-Noy and Ladner studied stream merging using competitive analysis. They designed an O(log n)-competitive online scheduler, where n is the totaln umber of stream requests. However, their result is applicable only to systems with large client bandwidth and buffer size. In this paper we design the first on-line scheduler for stream merging in the general setting, in which we lift the large resource requirements, and our scheduler achieves constant competitive ratio.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
C.C. Aggarwal, J.L. Wolf, and P.S. Yu On optimal batching policies for video-on-demand storage servers. In Proceedings of IEEE International Conference on Multimedia Computing and Systems, pages 253–258, 1996.
A. Bar-Noy and R.E. Ladner Competitive on-line stream merging algorithms for media-on-demand. In Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 364–373, 2001.
Y. Cai, K.A. Hua, and K. Vu Optimizing patching performance. In Proceedings of Conference on Multimedia Computing and Networking, pages 204–215, 1999.
W.-T. Chan, T.-W. Lam, H.-F. Ting, and W.-H. Wong A 5-competitive on-line scheduler for merging video streams. In Proceedings of the Fifteenth International Parallel and Distributed Processing Symposium, pages 201 (full version of the paper in the accompanied CD-ROM), 2001.
A. Dan, D. Sitaram, and P. Shahabuddin Scheduling policies for an on-demand video server with batching. In Proceedings of the Second ACM International Conference on Multimedia, pages 15–23, 1994.
D. Eager, M. Vernon, and J. Zahorjan Minimizing bandwidth requirements for on-demand data delivery. In Proceedings of the Fifth International Workshop on Advances in Multimedia Information Systems, pages 80–87, 1999.
D. Eager, M. Vernon, and J. Zahorjan Optimal and efficient merging schedules for video-on-demand servers. In Proceedings of the Seventh ACM International Conference on Multimedia, pages 199–202, 1999.
D. Eager, M. Vernon, and J. Zahorjan Bandwidth skimming: A technique for cost-effective video-on-demand. In Proceedings of Conference on Multimedia Computing and Networking, pages 206–215, 2000.
L. Gao and D. Towsley Supplying instantaneous video-on-demand services using controlled multicast. In Proceedings of IEEE International Conference on Multimedia Computing and Systems, pages 117–121, 1999.
K.A. Hua, Y. Cai, and K. Vu Patching: A multicast technique for true video-on-demand services. In Proceedings of the Sixth ACM International Conference on Multimedia, pages 191–200, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chan, WT., Lam, TW., Ting, HF., Wong, WH. (2001). Improved On-Line Stream Merging: From a Restricted to a General Setting. In: Wang, J. (eds) Computing and Combinatorics. COCOON 2001. Lecture Notes in Computer Science, vol 2108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44679-6_49
Download citation
DOI: https://doi.org/10.1007/3-540-44679-6_49
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42494-9
Online ISBN: 978-3-540-44679-8
eBook Packages: Springer Book Archive