Advertisement

Improved On-Line Stream Merging: From a Restricted to a General Setting

  • Wun-Tat Chan
  • Tak-Wah Lam
  • Hing-Fung Ting
  • Wai-Ha Wong
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2108)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    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.Google Scholar
  2. [2]
    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.Google Scholar
  3. [3]
    Y. Cai, K.A. Hua, and K. Vu Optimizing patching performance. In Proceedings of Conference on Multimedia Computing and Networking, pages 204–215, 1999.Google Scholar
  4. [4]
    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.Google Scholar
  5. [5]
    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.Google Scholar
  6. [6]
    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.Google Scholar
  7. [7]
    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.Google Scholar
  8. [8]
    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.Google Scholar
  9. [9]
    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.Google Scholar
  10. [10]
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Wun-Tat Chan
    • 1
  • Tak-Wah Lam
    • 1
  • Hing-Fung Ting
    • 1
  • Wai-Ha Wong
    • 1
  1. 1.Department of Computer ScienceUniversity of Hong KongHong Kong

Personalised recommendations