메뉴 건너뛰기




Volumn , Issue , 2013, Pages 421-427

Decentralized coded caching attains order-optimal memory-rate tradeoff

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER SCIENCE; CONTROL ENGINEERING;

EID: 84897731135     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/Allerton.2013.6736555     Document Type: Conference Paper
Times cited : (20)

References (10)
  • 1
    • 0020141865 scopus 로고
    • Comparative models of the file assignment problem
    • June
    • L. W. Dowdy and D. V. Foster, Comparative models of the file assignment problem, ACM Comput. Surv., vol. 14, pp. 287-313, June 1982
    • (1982) ACM Comput. Surv , vol.14 , pp. 287-313
    • Dowdy, L.W.1    Foster, D.V.2
  • 2
    • 0030216807 scopus 로고    scopus 로고
    • The use of multicast delivery to provide a scalable and interactive video-on-demand service
    • Aug
    • K. C. Almeroth and M. H. Ammar, The use of multicast delivery to provide a scalable and interactive video-on-demand service, IEEE J. Sel. Areas Commun., vol. 14, pp. 1110-1122, Aug. 1996
    • (1996) IEEE J. Sel. Areas Commun , vol.14 , pp. 1110-1122
    • Almeroth, K.C.1    Ammar, M.H.2
  • 3
    • 0000253811 scopus 로고    scopus 로고
    • Dynamic batching policies for an on-demand video server
    • June
    • A. Dan, D. Sitaram, and P. Shahabuddin, Dynamic batching policies for an on-demand video server, Multimedia Syst., vol. 4, pp. 112-121, June 1996
    • (1996) Multimedia Syst , vol.4 , pp. 112-121
    • Dan, A.1    Sitaram, D.2    Shahabuddin, P.3
  • 4
    • 0032761655 scopus 로고    scopus 로고
    • Placement algorithms for hierarchical cooperative caching
    • Jan
    • M. R. Korupolu, C. G. Plaxton, and R. Rajaraman, Placement algorithms for hierarchical cooperative caching, in Proc. ACM-SIAM SODA, pp. 586-595, Jan. 1999
    • (1999) Proc. ACM-SIAM SODA , pp. 586-595
    • Korupolu, M.R.1    Plaxton, C.G.2    Rajaraman, R.3
  • 6
    • 55249124781 scopus 로고    scopus 로고
    • Approximation algorithms for data placement problems
    • July
    • I. Baev, R. Rajaraman, and C. Swamy, Approximation algorithms for data placement problems, SIAM J. Comput., vol. 38, pp. 1411-1429, July 2008
    • (2008) SIAM J. Comput , vol.38 , pp. 1411-1429
    • Baev, I.1    Rajaraman, R.2    Swamy, C.3
  • 7
    • 77953315902 scopus 로고    scopus 로고
    • Distributed caching algorithms for content distribution networks
    • Mar
    • S. Borst, V. Gupta, and A. Walid, Distributed caching algorithms for content distribution networks, in Proc. IEEE INFOCOM, pp. 1-9, Mar. 2010
    • (2010) Proc IEEE INFOCOM , pp. 1-9
    • Borst, S.1    Gupta, V.2    Walid, A.3
  • 8
    • 84889605882 scopus 로고    scopus 로고
    • Fundamental limits of caching
    • Sept. Submitted to IEEE Trans. Inf. Theory
    • M. A. Maddah-Ali and U. Niesen, Fundamental limits of caching, arXiv:1209.5807 [cs.IT], Sept. 2012. Submitted to IEEE Trans. Inf. Theory
    • (2012) ArXiv:1209.5807 [Cs.IT]
    • Maddah-Ali, M.A.1    Niesen, U.2
  • 9
    • 84897699797 scopus 로고    scopus 로고
    • Decentralized caching attains order-optimal memory-rate tradeoff
    • Jan
    • M. A. Maddah-Ali and U. Niesen, Decentralized caching attains order-optimal memory-rate tradeoff, arXiv:1301.5848 [cs.IT], Jan. 2013
    • (2013) ArXiv:1301.5848 [Cs.IT]
    • Maddah-Ali, M.A.1    Niesen, U.2


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