메뉴 건너뛰기




Volumn , Issue , 2014, Pages 2142-2146

Hierarchical coded caching

Author keywords

[No Author keywords available]

Indexed keywords

DECODING; DISTRIBUTED COMPUTER SYSTEMS; INFORMATION THEORY;

EID: 84906569143     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2014.6875212     Document Type: Conference Paper
Times cited : (76)

References (13)
  • 2
    • 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. 1478- 1486, Mar. 2010.
    • (2010) Proc. IEEE INFOCOM , pp. 1478-1486
    • Borst, S.1    Gupta, V.2    Walid, A.3
  • 3
    • 84876292188 scopus 로고    scopus 로고
    • Optimal content placement for peer-to-peer video-on-demand systems
    • Apr
    • B. Tan and L. Massoulie, "Optimal content placement for peer-to-peer video-on-demand systems, " IEEE/ACM Trans. Netw., vol. 21, pp. 566- 579, Apr. 2013.
    • (2013) IEEE/ACM Trans. Netw , vol.21 , pp. 566-579
    • Tan, B.1    Massoulie, L.2
  • 5
    • 0032670943 scopus 로고    scopus 로고
    • Web caching and Zipf-like distributions: Evidence and implications
    • Mar
    • L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker, "Web caching and Zipf-like distributions: Evidence and implications, " in Proc. IEEE INFOCOM, pp. 126-134, Mar. 1999.
    • (1999) Proc. IEEE INFOCOM , pp. 126-134
    • Breslau, L.1    Cao, P.2    Fan, L.3    Phillips, G.4    Shenker, S.5
  • 7
    • 84906550226 scopus 로고    scopus 로고
    • Fundamental limits of caching
    • arXiv:1209.5807 [cs.IT], Sept
    • M. A. Maddah-Ali and U. Niesen, "Fundamental limits of caching, " arXiv:1209.5807 [cs.IT], Sept. 2012. To appear in IEEE Trans. Inf. Theory.
    • (2012) IEEE Trans. Inf. Theory
    • Maddah-Ali, M.A.1    Niesen, U.2
  • 8
    • 85027907954 scopus 로고    scopus 로고
    • Decentralized coded caching attains order-optimal memory-rate tradeoff
    • arXiv:1301.5848 [cs.IT], Jan
    • M. A. Maddah-Ali and U. Niesen, "Decentralized coded caching attains order-optimal memory-rate tradeoff, " arXiv:1301.5848 [cs.IT], Jan. 2013. To appear in IEEE/ACM Trans. Netw.
    • (2013) IEEE/ACM Trans. Netw.
    • Maddah-Ali, M.A.1    Niesen, U.2
  • 12
    • 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


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