메뉴 건너뛰기




Volumn , Issue , 2013, Pages 1077-1081

Fundamental limits of caching

Author keywords

[No Author keywords available]

Indexed keywords

BASIC STRUCTURE; CACHING SCHEME; CONSTANT FACTORS; GLOBAL CACHE; LOCAL CACHING; PREFETCHING; PROBLEM PARAMETERS; TRAFFIC RATE;

EID: 84890377347     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2013.6620392     Document Type: Conference Paper
Times cited : (51)

References (14)
  • 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
  • 10
    • 0031675783 scopus 로고    scopus 로고
    • Informed-source coding-on-demand (ISCOD) over broadcast channel
    • Mar
    • Y. Birk and T. Kol, "Informed-source coding-on-demand (ISCOD) over broadcast channel," in Proc. IEEE INFOCOM, pp. 1257-1264, Mar. 1998.
    • (1998) Proc. IEEE INFOCOM , pp. 1257-1264
    • Birk, Y.1    Kol, T.2
  • 14
    • 79251507985 scopus 로고    scopus 로고
    • On the hardness of approximating the network coding capacity
    • Feb
    • M. Langberg and A. Sprintson, "On the hardness of approximating the network coding capacity," IEEE Trans. Inf. Theory, vol. 57, pp. 1008-1014, Feb. 2011.
    • (2011) IEEE Trans. Inf. Theory , vol.57 , pp. 1008-1014
    • Langberg, M.1    Sprintson, A.2


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