Skip to main content
SpringerLink
Log in

Competitive Analysis of On-line Stream Merging Algorithms

  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 2002 (MFCS 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2420))

Abstract

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 worst-case analysis of the dyadic algorithm with respect to the total bandwidth, revealing that the dyadic algorithm can be tuned to be 3-competitive.

This research was supported in part by Hong Kong RGC Grant HKU-7024/01E.

This research was supported in part by Hong Kong RGC Grant HKU-7103/99E.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. C. Aggarwal, J. L. Wolf, and P. S. Yu. On optimal batching policies for video-on-demand storage servers. In Proc. International Conference on Multimedia Computing and Systems, pages 253–258, 1996.

    Google Scholar 

  2. C. C. Aggarwal, J. L. Wolf, and P. S. Yu. On optimal piggyback merging policies for video-on-demand systems. In Proc. ACM Sigmetrics, pages 200–209, 1996.

    Google Scholar 

  3. C. C. Aggarwal, J. L. Wolf, and P. S. Yu. A permutation-based pyramid broadcasting scheme for video-on-demand systems. In Proc. International Conference on Multimedia Computing and Systems, pages 118–126, 1996.

    Google Scholar 

  4. A. Bar-Noy, J. Goshi, R. E. Ladner, and K. Tam. Comparison of stream merging algorithms for media-on-demand. In Proc. Multimedia Computing and Networking, pages 115–129, 2002.

    Google Scholar 

  5. A. Bar-Noy and R. E. Ladner. Efficient algorithms for optimal stream merging algorithms for media-on-demand. Manuscript, 2000.

    Google Scholar 

  6. A. Bar-Noy and R. E. Ladner. Competitive on-line stream merging algorithms for media-on-demand. In Proc. 12th ACM-SIAM Symposium on Discrete Algorithms, pages 364–373, 2001.

    Google Scholar 

  7. Y. Cai, K. A. Hua, and K. Vu. Optimizing patching performance. In Proc. Multimedia Computing and Networking, pages 204–215, 1999.

    Google Scholar 

  8. S. W. Carter and D. D. E. Long. Improving bandwidth efficiency of video-on-demand. Computer Networks, 31(1–2):99–111, 1999.

    Google Scholar 

  9. W. T. Chan, T. W. Lam, H. F. Ting, and W. H. Wong. A unified analysis of hot video schedulers. In Proc. 34th ACM Symposium on Theory of Computing, 2002. To appear.

    Google Scholar 

  10. W. T. Chan, T. W. Lam, H. F. Ting, and W. H. Wong. On-line stream merging in a general setting. Theoretical Computer Science. To appear.

    Google Scholar 

  11. T. Chiueh and C. Lu. A periodic broadcasting approach to video-on-demand service. In Proc. Multimedia Computing and Networking, pages 162–169, 1995.

    Google Scholar 

  12. E. Coffman, P. Jelenkovi, and P. Momcilovic. The dyadic stream merging algorithm. Journal of Algorithms. To Appear.

    Google Scholar 

  13. A. Dan, D. Sitaram, and P. Shahabuddin. Dynamic batching policies for an on-demand video server. Multimedia Systems, 4(3):112–121, 1996.

    Article  Google Scholar 

  14. D. Eager, M. Vernon, and J. Zahorjan. Optimal and efficient merging schedules for video-on-demand servers. In Proc. 7th ACM Multimedia, pages 199–202, 1999.

    Google Scholar 

  15. D. Eager, M. Vernon, and J. Zahorjan. Minimizing bandwidth requirements for on-demand data delivery. IEEE Transactions on Knowledge and Data Engineering, 13(5):742–757, 2001.

    Article  Google Scholar 

  16. L. Golubchik, J. C. S. Lui, and R. R. Muntz. Adaptive piggybacking: A novel technique for data sharing in video-on-demand storage servers. Multimedia Systems, 4(3):140–155, 1996.

    Article  Google Scholar 

  17. K. A. Hua, Y. Cai, and S. Sheu. Patching: A multicast technique for true video-on-demand services. In Proc. 6th ACM Multimedia, pages 191–200, 1998.

    Google Scholar 

  18. K. A. Hua and S. Sheu. Skyscraper broadcasting: A new broadcasting scheme for metropolitan video-on-demand systems. In Proc. SIGCOMM, pages 89–100, 1997.

    Google Scholar 

  19. L.-S. Juhn and L.-M. Tseng. Harmonic broadcasting for video-on-demand service. IEEE Transactions on Broadcasting, 43(3):268–271, 1997.

    Article  Google Scholar 

  20. S. W. Lau, J. C. S. Lui, and L. Golubchik. Merging video streams in a multimedia storage server: Complexity and heuristics. Multimedia Systems, 6(1):29–42, 1998.

    Article  Google Scholar 

  21. J.-F. Paris, S. W. Carter, and D. D. E. Long. Efficient broadcasting protocols for video on demand. In Proc. 6th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, pages 127–132, 1998.

    Google Scholar 

  22. S. Sen, L. Gao, J. Rexford, and D. Towsley. Optimal patching schemes for efficient multimedia streaming. In Proc. 9th International Workshop on Network and Operating Systems Support for Digital Audio and Video, pages 44–55, 1999.

    Google Scholar 

  23. Y.-C. Tseng, C.-M. Hsieh, M.-H. Yang, W.-H. Liao, and J.-P. Sheu. Data broadcasting and seamless channel transition for highly-demanded videos. In Proc. 19th Annual Conference IEEE Computer and Communication Societies, pages 727–736, 2000.

    Google Scholar 

  24. S. Viswanathan and T. Imielinski. Metropolitan area video-on-demand service using pyramid broadcasting. Multimedia Systems, 4(3):197–208, 1996.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing, Hong Kong Polytechnic University, Hong Kong

    Wun-Tat Chan

  2. Department of Computer Science, University of Hong Kong, Hong Kong

    Tak-Wah Lam, Hing-Fung Ting & Prudence W. H. Wong

Authors
  1. Wun-Tat Chan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tak-Wah Lam
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hing-Fung Ting
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Prudence W. H. Wong
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Informatics, Warsaw University, ul. Banacha 2, 02-097, Warszawa, Poland

    Krzysztof Diks  & Wojciech Rytter  & 

  2. Department of Computer Science, Liverpool University, Peach Street, Liverpool, L69 7ZF, UK

    Wojciech Rytter

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chan, WT., Lam, TW., Ting, HF., Wong, P.W.H. (2002). Competitive Analysis of On-line Stream Merging Algorithms. In: Diks, K., Rytter, W. (eds) Mathematical Foundations of Computer Science 2002. MFCS 2002. Lecture Notes in Computer Science, vol 2420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45687-2_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-45687-2_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44040-6

  • Online ISBN: 978-3-540-45687-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation