메뉴 건너뛰기




Volumn , Issue , 2011, Pages 1783-1787

Codes for a distributed caching based Video-on-Demand system

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL PROBLEM; DISTRIBUTED CACHING; NETWORK CODES; OPTIMIZATION AND DESIGN; SYSTEM OPTIMIZATIONS; VIDEO-ON-DEMAND SYSTEM;

EID: 84861309125     PISSN: 10586393     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACSSC.2011.6190328     Document Type: Conference Paper
Times cited : (16)

References (19)
  • 14
    • 79251491334 scopus 로고    scopus 로고
    • Minimum cost mirror sites using network coding: Replication vs. coding at the source nodes
    • February
    • S. Huang, A. Ramamoorthy, M. Medard, "Minimum cost mirror sites using network coding: Replication vs. coding at the source nodes," IEEE Transactions on Information Theory, February 2011.
    • (2011) IEEE Transactions on Information Theory
    • Huang, S.1    Ramamoorthy, A.2    Medard, M.3
  • 15
    • 25644448947 scopus 로고    scopus 로고
    • Network coding for large scale content distribution
    • C. Gkantsidis and P. Rodriguez, "Network coding for large scale content distribution," in IEEE INFOCOM, 2005.
    • (2005) IEEE INFOCOM
    • Gkantsidis, C.1    Rodriguez, P.2
  • 18
    • 84861302522 scopus 로고    scopus 로고
    • Optimal content placement for P2P VoD systems
    • B. Tan and L. Massoulie, "Optimal content placement for P2P VoD systems," IEEE INFOCOM, 2011.
    • (2011) IEEE INFOCOM
    • Tan, B.1    Massoulie, L.2
  • 19
    • 0001174154 scopus 로고
    • Polynomial codes over certain finite fields
    • June
    • I. S. Reed and G. Solomon, "Polynomial codes over certain finite fields,"J. SIAM, vol. 8, June 1960.
    • (1960) J. SIAM , vol.8
    • Reed, I.S.1    Solomon, G.2


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