메뉴 건너뛰기




Volumn , Issue , 2001, Pages 2165-2172

A 5-competitive on-line scheduler for merging video streams

Author keywords

[No Author keywords available]

Indexed keywords

MERGING; SCHEDULING; VIDEO STREAMING;

EID: 84981276404     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2001.925217     Document Type: Conference Paper
Times cited : (4)

References (9)
  • 1
    • 0029715592 scopus 로고    scopus 로고
    • On optimal batching policies for video-on-demand storage servers
    • Hiroshima, Japan, 17-23 June
    • C. C. Aggarwal, J. L. Wolf, and P. S. Yu. On optimal batching policies for video-on-demand storage servers. In Proc. 1996 ICMCS, pages 253-258, Hiroshima, Japan, 17-23 June 1996.
    • (1996) Proc. 1996 ICMCS , pp. 253-258
    • Aggarwal, C.C.1    Wolf, J.L.2    Yu, P.S.3
  • 3
    • 0002466690 scopus 로고    scopus 로고
    • Competitive on-line stream merging algorithms for medio-on-demand
    • Washington, DC, 7-9 Jan
    • A. Bar-Noy and R. E. Ladner. Competitive on-line stream merging algorithms for medio-on-demand. In Proc. 12th ACM-SIAM SODA, Washington, DC, 7-9 Jan. 2001.
    • (2001) Proc. 12th ACM-SIAM SODA
    • Bar-Noy, A.1    Ladner, R.E.2
  • 4
    • 0032640699 scopus 로고    scopus 로고
    • Optimizing patching performance
    • San Jose, CA
    • Y. Cai, K. A. Hua, and K. Vu. Optimizing patching performance. In Proc. MMCN, pages 204-215, San Jose, CA, 1999.
    • (1999) Proc. MMCN , pp. 204-215
    • Cai, Y.1    Hua, K.A.2    Vu, K.3
  • 5
    • 85020557134 scopus 로고
    • Scheduling policies for an on-demand video server with batching
    • San Francisco, CA, 15-20 Oct
    • A. Dan, D. Sitaram, and P. Shahabuddin. Scheduling policies for an on-demand video server with batching. In Proc. 2nd ACM Multimedia, pages 15-23, San Francisco, CA, 15-20 Oct. 1994.
    • (1994) Proc. 2nd ACM Multimedia , pp. 15-23
    • Dan, A.1    Sitaram, D.2    Shahabuddin, P.3
  • 6
    • 0002093442 scopus 로고    scopus 로고
    • Minimizing bandwidth requirements for on-demand data delivery
    • Indian Wells, CA
    • D. Eager, M. Vernon, and J. Zahorjan. Minimizing bandwidth requirements for on-demand data delivery. In Proc. 5th MIS, pages 80-87, Indian Wells, CA, 1999.
    • (1999) Proc. 5th MIS , pp. 80-87
    • Eager, D.1    Vernon, M.2    Zahorjan, J.3
  • 7
    • 0033279457 scopus 로고    scopus 로고
    • Optimal and efficient merging schedules for video-on-demand servers
    • Orlanda, FL, Nov
    • 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, Orlanda, FL, Nov. 1999.
    • (1999) Proc. 7th ACM Multimedia , pp. 199-202
    • Eager, D.1    Vernon, M.2    Zahorjan, J.3
  • 8
    • 0032657107 scopus 로고    scopus 로고
    • Supplying instantaneous video-on-demand services using controlled multicast
    • Florence, Italy, 7-11 June
    • L. Gao and D. Towsley. Supplying instantaneous video-on-demand services using controlled multicast. In Proc. 1999 ICMCS, pages 117-121, Florence, Italy, 7-11 June 1999.
    • (1999) Proc. 1999 ICMCS , pp. 117-121
    • Gao, L.1    Towsley, D.2
  • 9
    • 84905823568 scopus 로고    scopus 로고
    • Patching: A multicast technique for true video-on-demand services
    • Bristol, U.K., Sept
    • K. A. Hua, Y. Cai, and K. Vu. Patching: A multicast technique for true video-on-demand services. In Proc. 6th ACM Multimedia, pages 191-200, Bristol, U.K., Sept. 1998.
    • (1998) Proc. 6th ACM Multimedia , pp. 191-200
    • Hua, K.A.1    Cai, Y.2    Vu, K.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.