메뉴 건너뛰기




Volumn 57, Issue 13, 2013, Pages 2465-2482

Performance analysis of in-network caching for content-centric networking

Author keywords

Content centric networking; In network caching; Information centric networking; Optimal content assignment

Indexed keywords

CACHE REPLACEMENT POLICY; CONTENT-CENTRIC NETWORKINGS; EVALUATION AND ANALYSIS; IN NETWORKS; INFORMATION-CENTRIC NETWORKINGS; INFORMATION-CENTRIC NETWORKINGS (ICN); MIXED-INTEGER PROGRAMS; OPTIMAL CONTENT;

EID: 84880923202     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2012.11.026     Document Type: Article
Times cited : (84)

References (38)
  • 11
    • 0036038685 scopus 로고    scopus 로고
    • Storage management and caching in past, a large-scale, persistent peer-to-peer storage utility
    • ACM
    • A. Rowstron, and P. Druschel Storage management and caching in past, a large-scale, persistent peer-to-peer storage utility ACM SIGOPS Operating Systems Review vol. 35 2001 ACM 188 201
    • (2001) ACM SIGOPS Operating Systems Review , vol.35 VOL. , pp. 188-201
    • Rowstron, A.1    Druschel, P.2
  • 13
    • 77958138374 scopus 로고    scopus 로고
    • The akamai network: A platform for high-performance internet applications
    • E. Nygren, R. Sitaraman, and J. Sun The akamai network: a platform for high-performance internet applications ACM SIGOPS Operating Systems Review 44 3 2010 2 19
    • (2010) ACM SIGOPS Operating Systems Review , vol.44 , Issue.3 , pp. 2-19
    • Nygren, E.1    Sitaraman, R.2    Sun, J.3
  • 17
    • 70450265592 scopus 로고    scopus 로고
    • Smartre: An architecture for coordinated network-wide redundancy elimination
    • ACM
    • A. Anand, V. Sekar, and A. Akella Smartre: an architecture for coordinated network-wide redundancy elimination ACM SIGCOMM Computer Communication Review vol. 39 2009 ACM 87 98
    • (2009) ACM SIGCOMM Computer Communication Review , vol.39 VOL. , pp. 87-98
    • Anand, A.1    Sekar, V.2    Akella, A.3
  • 19
    • 84885888265 scopus 로고    scopus 로고
    • Multiaccess netinf: A prototype and simulations
    • T. Rautio, O. Mmmel, J. Mkel, Multiaccess netinf: a prototype and simulations, in: TRIDENTCOM'10, 2010, pp. 605-608.
    • (2010) TRIDENTCOM'10 , pp. 605-608
    • Rautio, T.1    Mmmel, O.2    Mkel, J.3
  • 24
    • 79952041575 scopus 로고    scopus 로고
    • Multicache: An overlay architecture for information-centric networking
    • K. Katsaros, G. Xylomenos, and G. Polyzos Multicache: an overlay architecture for information-centric networking Computer Networks 55 4 2011 936 947
    • (2011) Computer Networks , vol.55 , Issue.4 , pp. 936-947
    • Katsaros, K.1    Xylomenos, G.2    Polyzos, G.3
  • 25
    • 84866627772 scopus 로고    scopus 로고
    • Caching Performance of Content Centric Networks under Multi-Path Routing (and more)
    • Tech. Rep.
    • D. Rossi, D. Rossini, Caching Performance of Content Centric Networks Under Multi-Path Routing (and more), Tech. Rep., Technical Report, Telecom ParisTech (2011).
    • (2011) Technical Report, Telecom ParisTech
    • Rossi, D.1    Rossini, D.2
  • 26
    • 84862071204 scopus 로고    scopus 로고
    • A Dive into the Caching Performance of Content Centric Networking
    • Tech. Rep.
    • D. Rossini, D. Rossi, A Dive into the Caching Performance of Content Centric Networking, Tech. Rep., Technical Report, Telecom ParisTech (2011).
    • (2011) Technical Report, Telecom ParisTech
    • Rossini, D.1    Rossi, D.2
  • 31
    • 77953315902 scopus 로고    scopus 로고
    • Distributed caching algorithms for content distribution networks
    • IEEE
    • S. Borst, V. Gupta, A. Walid, Distributed caching algorithms for content distribution networks, in: INFOCOM, 2010 Proceedings IEEE, IEEE, 2010.
    • (2010) INFOCOM, 2010 Proceedings IEEE
    • Borst, S.1    Gupta, V.2    Walid, A.3
  • 36
    • 0014814325 scopus 로고
    • Space/time trade-offs in hash coding with allowable errors
    • B. Bloom Space/time trade-offs in hash coding with allowable errors Communications of the ACM 13 7 1970 422 426
    • (1970) Communications of the ACM , vol.13 , Issue.7 , pp. 422-426
    • Bloom, B.1


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