On-line stream merging with max span and min coverage

Theory of Computing Systems

Volumn 38, Issue 4, 2005, Pages 461-479

  Chan, Wun Tat ^a   Lam, Tak Wah ^b   Ting, Hing Fung ^b   Wong, Prudence W H ^b  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

DATA RECEIVING; GREEDY ALGORITHMS; ON-LINE STREAM; STREAMING ALGORITHM;

ALGORITHMS; BANDWIDTH; COMPUTATIONAL METHODS; COMPUTER ARCHITECTURE; DATA REDUCTION; MULTICASTING; RESPONSE TIME (COMPUTER SYSTEMS); VIDEO ON DEMAND;

MERGING;

EID: 22344453477     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-004-1182-2     Document Type: Conference Paper

References (16)

1. C. C. Aggarwal, J. L. Wolf, and P. S. Yu. On optimal piggyback merging policies for video-on-demand systems. In Proceedings of ACM Sigmetrics Conference, pages 200-209, 1996.
2. A. Bar-Noy, J. Goshi, R. E. Ladner, and K. Tam. Comparison of stream merging algorithms for media-on-demand. In Proceedings of Conference on Multimedia Computing and Networking, pages 115-129, 2002.
3. 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.
4. Y. Cai, K. A. Hua, and K. Vu. Optimizing patching performance. In Proceedings of Conference on Multimedia Computing and Networking, pages 204-215, 1999.
5. S. W. Carter and D. D. E. Long. Improving bandwidth efficiency of video-on-demand. Computer Networks, 31(1-2):99-111, 1999.
6. W. T. Chan, T. W. Lam, H. F. Ting, and P. W. H. Wong. Competitive analysis of on-line stream merging algorithms. In Proceedings of the Twenty-Seventh Annual International Symposium on Mathematical Foundations of Computer Science, pages 188-200, 2002.
7. W. T. Chan, T. W. Lam, H. F. Ting, and P. W. H. Wong. A unified analysis of hot video schedulers. In Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, pages 179-188, 2002.
8. W. T. Chan, T. W. Lam, H. F. Ting, and P. W. H. Wong. On-line stream merging in a general setting. Theoretical Computer Science, 296(1):27-46, 2003.
9. E. Coffman, P. Jelenkovic, and P. Momcilovic. The dyadic stream merging algorithm. Journal of Algorithms, 43(1): 120-137, 2002.
10. 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.
11. 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.
12. L. Golubchik, J. C. S. Lui, and R. R. Muntz. Adaptive piggybacking: a novel technique for data sharing in video-on-demand storage servers. ACM Journal of Multimedia Systems, 4(3):140-155, 1996.
13. K. A. Hua, Y. Cai, and S. Sheu. Patching: a multicast technique for true video-on-demand services. In Proceedings of the Sixth ACM International Conference on Multimedia, pages 191-200, 1998.
14. S. W. Lau, J. C. S. Lui, and L. Golubchik. Merging video streams in a multimedia storage server: complexity and heuristics. ACM Journal of Multimedia Systems, 6(1):29-42, 1998.
15. S. Sen, L. Gao, J. Rexford, and D. Towsley. Optimal patching schemes for efficient multimedia streaming. In Proceedings of the Ninth International Workshop on Network and Operating Systems Support for Digital Audio and Video, pages 44-55, 1999.
16. P. W. H. Wong. On-Line Scheduling of Video Streams. Ph.D. thesis, The University of Hong Kong, 2002.