Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

International Conference on Research in Networking

NETWORKING 2012: NETWORKING 2012 pp 27–40Cite as

  1. Home
  2. NETWORKING 2012
  3. Conference paper
Cache “Less for More” in Information-Centric Networks

Cache “Less for More” in Information-Centric Networks

  • Wei Koong Chai20,
  • Diliang He20,
  • Ioannis Psaras20 &
  • …
  • George Pavlou20 
  • Conference paper
  • 2816 Accesses

  • 130 Citations

  • 1 Altmetric

Part of the Lecture Notes in Computer Science book series (LNCCN,volume 7289)

Abstract

Ubiquitous in-network caching is one of the key aspects of information-centric networking (ICN) which has recently received widespread research interest. In one of the key relevant proposals known as Networking Named Content (NNC), the premise is that leveraging in-network caching to store content in every node it traverses along the delivery path can enhance content delivery. We question such indiscriminate universal caching strategy and investigate whether caching less can actually achieve more. Specifically, we investigate if caching only in a subset of node(s) along the content delivery path can achieve better performance in terms of cache and server hit rates. In this paper, we first study the behavior of NNC’s ubiquitous caching and observe that even naïve random caching at one intermediate node within the delivery path can achieve similar and, under certain conditions, even better caching gain. We propose a centrality-based caching algorithm by exploiting the concept of (ego network) betweenness centrality to improve the caching gain and eliminate the uncertainty in the performance of the simplistic random caching strategy. Our results suggest that our solution can consistently achieve better gain across both synthetic and real network topologies that have different structural properties.

Keywords

  • Information-centric networking
  • caching
  • betweenness centrality

Download conference paper PDF

References

  1. Koponen, T., et al.: A Data-oriented (and Beyond) Network Architecture. In: Proc. ACM SIGCOMM 2007, Kyoto, Japan (August 2007)

    Google Scholar 

  2. Jacobson, V., Smetters, D.K., Thornton, J.D., Plass, M., Briggs, N., Braynard, R.L.: Networking Named Content. In: Proc. ACM CoNEXT, pp. 1–12 (2009)

    Google Scholar 

  3. Trossen, D., et al.: Conceptual Architecture: Principles, Patterns and Sub-components Descriptions (May 2011), http://www.fp7-pursuit.eu/PursuitWeb/

  4. Jokela, P., Zahemszky, A., Rothenberg, C., Arianfar, S., Nikander, P.: LIPSIN: Line Speed Publish/Subscribe Inter-networking. In: Proc. ACM SIGCOMM, Barcelona, Spain (2009)

    Google Scholar 

  5. Chai, W.K., et al.: CURLING: Content-ubiquitous resolution and delivery infrastructure for next-generation services. IEEE Commun. Mag. 49(3), 112–120 (2011)

    CrossRef  Google Scholar 

  6. Psaras, I., Clegg, R.G., Landa, R., Chai, W.K., Pavlou, G.: Modelling and Evaluation of CCN-Caching Trees. In: Domingo-Pascual, J., Manzoni, P., Palazzo, S., Pont, A., Scoglio, C. (eds.) NETWORKING 2011, Part I. LNCS, vol. 6640, pp. 78–91. Springer, Heidelberg (2011)

    CrossRef  Google Scholar 

  7. Carofiglio, G., Gallo, M., Muscariello, L., Perrino, D.: Modelling data transfer in content centric networking. In: Proc. International Teletraffic Congress, ITC (2011)

    Google Scholar 

  8. Arianfar, S., Nikander, P., Ott, J.: Packet-level caching for information-centric networking. Finnish ICT-SHOK Future Internet Project, Tech. Rep. (2010)

    Google Scholar 

  9. Ghodsi, A., et al.: Information-centric Networking: Seeing the forest for the trees. In: ACM Workshop on Hot Topics in Networks (HotNets-X), Cambridge, MA (November 2011)

    Google Scholar 

  10. Dan, A., Towsley, D.: An approximate analysis of the lru and fifo buffer replacement schemes. In: ACM SIGMETRICS, pp. 143–152 (1990)

    Google Scholar 

  11. Jelenkovic, P., Radovanovic, A., Squillante, M.S.: Critical sizing of lru caches with dependent requests. Journal of Applied Probability 43(4), 1013–1027 (2006)

    CrossRef  MathSciNet  MATH  Google Scholar 

  12. Laoutaris, N., Smaragdakis, G., Bestavros, A., Matta, I., Stavrakakis, I.: Distributed selfish caching. IEEE Trans. on Parallel and Distributed Systems 18(10) (2007)

    Google Scholar 

  13. Dán, G.: Cache-to-Cache: Could ISPs cooperate to decrease peer-to-peer content distribution costs? IEEE Trans. on Parallel and Distributed Systems 22(9) (2011)

    Google Scholar 

  14. Che, H., Tung, Y., Wang, Z.: Hierarchical web caching systems: modelling, design and experimental results. IEEE Journ. on Selected Areas of Communications 20(7) (2002)

    Google Scholar 

  15. Laoutaris, N., Che, H., Stavrakakis, I.: The LCD interconnection of LRU caches and its analysis. Performance Evaluation 63(7), 609–634 (2006)

    CrossRef  Google Scholar 

  16. Wong, T.M., Wilkes, J.: My cache or yours? Making storage more exclusive. In: Proc. USENIX Annual Technical Conference, Monterey, CA, pp. 161–175 (2002)

    Google Scholar 

  17. Izquierdo, L.R., Hanneman, R.A.: Introduction to the Formal Analysis of Social Networks Using Mathematica. University of California, Riverside

    Google Scholar 

  18. Everett, M., Borgatti, S.: Ego network betweenness. Social Networks 27, 31–38 (2005)

    CrossRef  Google Scholar 

  19. Pantazopoulos, P., Karaliopoulos, M., Stavrakakis, I.: Centrality-driven scalable service migration. In: Proc. International Teletraffic Congress, ITC (2011)

    Google Scholar 

  20. Barabasi, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)

    CrossRef  MathSciNet  Google Scholar 

  21. Wang, H., Hernandez, J.M., Van Mieghem, P.: Betweenness centrality in a weighted network. Physical Review E 77, 046105 (2008)

    Google Scholar 

  22. CAIDA dataset, http://www.caida.org/research/topology/#Datasets

Download references

Author information

Authors and Affiliations

  1. Department of Electronic and Electrical Engineering, University College London, WC1E 6BT, Gower Street, London, UK

    Wei Koong Chai, Diliang He, Ioannis Psaras & George Pavlou

Authors
  1. Wei Koong Chai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Diliang He
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ioannis Psaras
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. George Pavlou
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Telecommunications Engineering, Czech Technical University in Prague, Technicka 2, 166 27, Prague 6, Czech Republic

    Robert Bestak & Lukas Kencl & 

  2. Alcatel-Lucent, Bell Labs, 600 Mountain Avenue, 07974-0636, Murray Hill, NJ, USA

    Li Erran Li

  3. Instituto IMDEA Networks, Avenida del Mar Mediterraneo 22, Leganes, 28918, Madrid), Spain

    Joerg Widmer

  4. Tsinghua-ChinaCache Joint Laboratory, Tsinghua University, FIT 3-429, Haidian District, 100016, Beijing, China

    Hao Yin

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 IFIP International Federation for Information Processing

About this paper

Cite this paper

Chai, W.K., He, D., Psaras, I., Pavlou, G. (2012). Cache “Less for More” in Information-Centric Networks. In: Bestak, R., Kencl, L., Li, L.E., Widmer, J., Yin, H. (eds) NETWORKING 2012. NETWORKING 2012. Lecture Notes in Computer Science, vol 7289. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30045-5_3

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-642-30045-5_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30044-8

  • Online ISBN: 978-3-642-30045-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature