메뉴 건너뛰기




Volumn 6, Issue 2, 2004, Pages 356-365

Minimizing Delivery Cost in Scalable Streaming Content Distribution Systems

Author keywords

Content distribution systems; Modeling; Streaming media

Indexed keywords

BANDWIDTH; HEURISTIC METHODS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; OPTIMIZATION; ROUTERS; SERVERS; TOPOLOGY; TREES (MATHEMATICS);

EID: 16544378851     PISSN: 15209210     EISSN: None     Source Type: Journal    
DOI: 10.1109/TMM.2003.822796     Document Type: Article
Times cited : (58)

References (25)
  • 2
    • 0036349005 scopus 로고    scopus 로고
    • Provisioning content distribution networks for streaming media
    • New York, June
    • J. M. Almeida, D. L. Eager, M. C. Ferris, and M. K. Vernon, "Provisioning content distribution networks for streaming media," in Proc. INFOCOM, New York, June 2002.
    • (2002) Proc. INFOCOM
    • Almeida, J.M.1    Eager, D.L.2    Ferris, M.C.3    Vernon, M.K.4
  • 3
    • 0034819334 scopus 로고    scopus 로고
    • Analysis of educational media server workloads
    • Port Jefferson, NY, June
    • J. M. Almeida, J. Krueger, D. L. Eager, and M. K. Vernon, "Analysis of educational media server workloads," in Proc. NOSSDAV, Port Jefferson, NY, June 2001.
    • (2001) Proc. NOSSDAV
    • Almeida, J.M.1    Krueger, J.2    Eager, D.L.3    Vernon, M.K.4
  • 4
    • 0036346222 scopus 로고    scopus 로고
    • On multiple description streaming with content delivery networks
    • New York, June
    • J. Apostolopoulos, T. Wong, W.-T. Tan, and S. Wee, "On multiple description streaming with content delivery networks," in Proc. INFOCOM, New York, June 2002.
    • (2002) Proc. INFOCOM
    • Apostolopoulos, J.1    Wong, T.2    Tan, W.-T.3    Wee, S.4
  • 5
    • 0031997974 scopus 로고    scopus 로고
    • A note on the complexity of Dijkstra's algorithm for graphs with weighted vertices
    • Feb.
    • M. Barbehenn, "A note on the complexity of Dijkstra's algorithm for graphs with weighted vertices," IEEE Trans. Comput., vol. 47, p. 263, Feb. 1998.
    • (1998) IEEE Trans. Comput. , vol.47 , pp. 263
    • Barbehenn, M.1
  • 6
    • 0002466690 scopus 로고    scopus 로고
    • Competitive on-line stream merging algorithms for media-on-demand
    • Washington, DC, Jan.
    • A. Bar-Noy and R. E. Ladner, "Competitive on-line stream merging algorithms for media-on-demand," in Proc. ACM-SIAM Symp. Discrete Algorithms, Washington, DC, Jan. 2001.
    • (2001) Proc. ACM-SIAM Symp. Discrete Algorithms
    • Bar-Noy, A.1    Ladner, R.E.2
  • 10
    • 0035439050 scopus 로고    scopus 로고
    • Minimizing bandwidth requirements for on-demand data delivery
    • Sep./Oct.
    • D. Eager, M. Vernon, and J. Zahorjan, "Minimizing bandwidth requirements for on-demand data delivery," IEEE Trans. Knowl. Data Eng., vol. 13, pp. 742-757, Sep./Oct. 2001.
    • (2001) IEEE Trans. Knowl. Data Eng. , vol.13 , pp. 742-757
    • Eager, D.1    Vernon, M.2    Zahorjan, J.3
  • 11
    • 0036734868 scopus 로고    scopus 로고
    • Multicast server selection: Problems, complexity and solutions
    • Sept.
    • Z. Fei, M. Ammar, and E. Zegura, "Multicast server selection: Problems, complexity and solutions," IEEE J. Select. Areas Commun., vol. 20, pp. 1399-1413, Sept. 2002.
    • (2002) IEEE J. Select. Areas Commun. , vol.20 , pp. 1399-1413
    • Fei, Z.1    Ammar, M.2    Zegura, E.3
  • 13
    • 0002997131 scopus 로고    scopus 로고
    • Skyscraper broadcasting: A new broadcasting scheme for metropolitan video on demand systems
    • Cannes, France, Sept.
    • K. Hua and S. Sheu, "Skyscraper broadcasting: A new broadcasting scheme for metropolitan video on demand systems," in Proc. ACM SIGCOMM, Cannes, France, Sept. 1997.
    • (1997) Proc. ACM SIGCOMM
    • Hua, K.1    Sheu, S.2
  • 14
    • 84905823568 scopus 로고    scopus 로고
    • Patching: A multicast technique for true video-on-demand services
    • Bristol, U.K., Sept.
    • K. Hua, Y. Cai, and S. Sheu, "Patching: A multicast technique for true video-on-demand services," in Proc. ACM Multimedia, Bristol, U.K., Sept. 1998.
    • (1998) Proc. ACM Multimedia
    • Hua, K.1    Cai, Y.2    Sheu, S.3
  • 16
    • 0035015620 scopus 로고    scopus 로고
    • Constrained mirror placement on the Internet
    • Anchorage, AK, Apr.
    • S. Jamin, C. Jiu, A. Kurc, D. Raz, and Y. Shavitt, "Constrained mirror placement on the Internet," in Proc. INFOCOM, Anchorage, AK, Apr. 2001.
    • (2001) Proc. INFOCOM
    • Jamin, S.1    Jiu, C.2    Kurc, A.3    Raz, D.4    Shavitt, Y.5
  • 19
    • 0034997459 scopus 로고    scopus 로고
    • On the placement of web server replicas
    • Anchorage, AK, Apr.
    • L. Qiu, V. Padmanabhan, and G. Voelker, "On the placement of web server replicas," in Proc. INFOCOM, Anchorage, AK, Apr. 2001.
    • (2001) Proc. INFOCOM
    • Qiu, L.1    Padmanabhan, V.2    Voelker, G.3
  • 20
    • 0036497482 scopus 로고    scopus 로고
    • Topology-informed Internet replica placement
    • Mar.
    • P. Radoslavov, R. Govindam, and D. Estrin, "Topology-informed Internet replica placement," Comput. Commun., vol. 25, no. 4, pp. 384-392, Mar. 2002.
    • (2002) Comput. Commun. , vol.25 , Issue.4 , pp. 384-392
    • Radoslavov, P.1    Govindam, R.2    Estrin, D.3
  • 21
    • 16544375885 scopus 로고    scopus 로고
    • Delimiting the effectiveness of scalable streaming protocols
    • Rome, Italy, Sept.
    • H. Tan, D. L. Eager, and M. K. Vernon, "Delimiting the effectiveness of scalable streaming protocols," in Proc. Performance, Rome, Italy, Sept. 2002.
    • (2002) Proc. Performance
    • Tan, H.1    Eager, D.L.2    Vernon, M.K.3
  • 22
    • 0036497463 scopus 로고    scopus 로고
    • Joint server scheduling and proxy caching for video delivery
    • Mar.
    • O. Verscheure, C. Venkatramani, P. Frossard, and L. Amini, "Joint server scheduling and proxy caching for video delivery," Comput. Commun., vol. 25, no. 4, pp. 413-423, Mar. 2002.
    • (2002) Comput. Commun. , vol.25 , Issue.4 , pp. 413-423
    • Verscheure, O.1    Venkatramani, C.2    Frossard, P.3    Amini, L.4
  • 23
    • 0036349484 scopus 로고    scopus 로고
    • Optimal proxy cache allocation for efficient streaming media distribution
    • New York, June
    • B. Wang, S. Sen, M. Adler, and D. Towsley, "Optimal proxy cache allocation for efficient streaming media distribution," in Proc. INFOCOM, New York, June 2002.
    • (2002) Proc. INFOCOM
    • Wang, B.1    Sen, S.2    Adler, M.3    Towsley, D.4
  • 25
    • 0036346550 scopus 로고    scopus 로고
    • Network bandwidth requirements for scalable on-demand streaming
    • New York, NY, June
    • Y. Zhao, D. L. Eager, and M. K. Vernon, "Network bandwidth requirements for scalable on-demand streaming," in Proc. INFOCOM, New York, NY, June 2002.
    • (2002) Proc. INFOCOM
    • Zhao, Y.1    Eager, D.L.2    Vernon, M.K.3


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