On-line stream merging in a general setting

Theoretical Computer Science

Volumn 296, Issue 1, 2003, Pages 27-46

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

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTER SIMULATION; MERGING; SCHEDULING; VIDEO ON DEMAND;

ON-LINE SCHEDULING;

SERVERS;

EID: 0037269031     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00430-9     Document Type: Conference Paper

References (18)

1. C.C. Aggarwal, J.L. Wolf, P.S. Yu, On optimal batching policies for video-on-demand storage servers, in: Proc. IEEE Internat. Conf. on Multimedia Computing and Systems, Hiroshima, Japan, 1996, pp. 253-258.
2. C.C. Aggarwal, J.L. Wolf, P.S. Yu, On optimal piggyback merging policies for video-on-demand systems, in: Proc. ACM Sigmetrics Conf., Philadelphia, PA, USA, 1996, pp. 200-209.
3. A. Bar-Noy, J. Goshi, R.E. Ladner, K. Tam, Comparison of stream merging algorithms for media-on-demand, in: Proc. Conf. on Multimedia Computing and Networking, San Jose, CA, USA, 2002, pp. 115-129.
4. A. Bar-Noy, R.E. Ladner, Competitive on-line stream merging algorithms for media-on-demand, in: Proc. 12 Annu. ACM-SIAM Symp. on Discrete Algorithms, Washington, DC, USA, 2001, pp. 364-373.
5. Borodin A., El-Yaniv R. Online Computation and Competitive Analysis. 1998;Cambridge University Press, Cambridge.
6. Y. Cai, K.A. Hua, K. Vu, Optimizing patching performance, in: Proc. Conf. on Multimedia Computing and Networking, San Jose, CA, USA, 1999, pp. 204-215.
7. Carter S.W., Long D.D.E. Improving bandwidth efficiency of video-on-demand. Computer Networks. 31(1-2):1999;99-111.
8. T. Chiueh, C. Lu, A periodic broadcasting approach to video-on-demand service, in: Proc. Conf. on Multimedia Computing and Networking, San Jose, CA, USA, 1995, pp. 162-169.
9. Coffman E., Jelenkovi P., Momcilovic P. The dyadic stream merging algorithm. J. Algorithms. 43(1):2002;120-137.
10. Dan A., Sitaram D., Shahabuddin P. Dynamic batching policies for an on-demand video server. ACM J. Multimedia Systems. 4(3):1996;112-121.
11. D. Eager, M. Vernon, J. Zahorjan, Optimal and efficient merging schedules for video-on-demand servers, in: Proc. Seventh ACM Internat. Conf. on Multimedia, Orlando, FL, USA, 1999, pp. 199-202.
12. D. Eager, M. Vernon, J. Zahorjan, Bandwidth skimming: a technique for cost-effective video-on-demand, in: Proc. Conf. on Multimedia Computing and Networking, San Jose, CA, USA, 2000, pp. 206-215.
13. Eager D., Vernon M., Zahorjan J. Minimizing bandwidth requirements for on-demand data delivery. IEEE Trans. Knowledge Data Eng. 13(5):2001;742-757.
14. Golubchik L., Lui J.C.S., Muntz R.R. Adaptive piggybacking. a novel technique for data sharing in video-on-demand storage servers ACM J. Multimedia Systems. 4(3):1996;140-155.
15. K.A. Hua, Y. Cai, S. Sheu, Patching: a multicast technique for true video-on-demand services, in: Proc. Sixth ACM Internat. Conf. on Multimedia, Bristol, UK, 1998, pp. 191-200.
16. Lau S.W., Lui J.C.S., Golubchik L. Merging video streams in a multimedia storage server. complexity and heuristics ACM J. Multimedia Systems. 6(1):1998;29-42.
17. S. Sen, L. Gao, J. Rexford, D. Towsley, Optimal patching schemes for efficient multimedia streaming, in: Proc. Ninth Internat. Workshop on Network and Operating Systems Support for Digital Audio and Video, Basking Ridge, NJ, USA, 1999, pp. 44-55.
18. Viswanathan S., Imielinski T. Metropolitan area video-on-demand service using pyramid broadcasting. ACM J. Multimedia Systems. 4(3):1996;197-208.