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.
Chapter PDF
Similar content being viewed by others
References
Koponen, T., et al.: A Data-oriented (and Beyond) Network Architecture. In: Proc. ACM SIGCOMM 2007, Kyoto, Japan (August 2007)
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)
Trossen, D., et al.: Conceptual Architecture: Principles, Patterns and Sub-components Descriptions (May 2011), http://www.fp7-pursuit.eu/PursuitWeb/
Jokela, P., Zahemszky, A., Rothenberg, C., Arianfar, S., Nikander, P.: LIPSIN: Line Speed Publish/Subscribe Inter-networking. In: Proc. ACM SIGCOMM, Barcelona, Spain (2009)
Chai, W.K., et al.: CURLING: Content-ubiquitous resolution and delivery infrastructure for next-generation services. IEEE Commun. Mag. 49(3), 112–120 (2011)
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)
Carofiglio, G., Gallo, M., Muscariello, L., Perrino, D.: Modelling data transfer in content centric networking. In: Proc. International Teletraffic Congress, ITC (2011)
Arianfar, S., Nikander, P., Ott, J.: Packet-level caching for information-centric networking. Finnish ICT-SHOK Future Internet Project, Tech. Rep. (2010)
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)
Dan, A., Towsley, D.: An approximate analysis of the lru and fifo buffer replacement schemes. In: ACM SIGMETRICS, pp. 143–152 (1990)
Jelenkovic, P., Radovanovic, A., Squillante, M.S.: Critical sizing of lru caches with dependent requests. Journal of Applied Probability 43(4), 1013–1027 (2006)
Laoutaris, N., Smaragdakis, G., Bestavros, A., Matta, I., Stavrakakis, I.: Distributed selfish caching. IEEE Trans. on Parallel and Distributed Systems 18(10) (2007)
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)
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)
Laoutaris, N., Che, H., Stavrakakis, I.: The LCD interconnection of LRU caches and its analysis. Performance Evaluation 63(7), 609–634 (2006)
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)
Izquierdo, L.R., Hanneman, R.A.: Introduction to the Formal Analysis of Social Networks Using Mathematica. University of California, Riverside
Everett, M., Borgatti, S.: Ego network betweenness. Social Networks 27, 31–38 (2005)
Pantazopoulos, P., Karaliopoulos, M., Stavrakakis, I.: Centrality-driven scalable service migration. In: Proc. International Teletraffic Congress, ITC (2011)
Barabasi, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)
Wang, H., Hernandez, J.M., Van Mieghem, P.: Betweenness centrality in a weighted network. Physical Review E 77, 046105 (2008)
CAIDA dataset, http://www.caida.org/research/topology/#Datasets
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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
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)