Abstract
Content Centric Networking is a promising architecture for the Future Internet to deliver content at large-scale. It relies on named data and caching features which consists of storing content across the delivery path to serve forthcoming requests. As some content is more likely to be requested than other, caching only popular content may help to manage the cache of CCN nodes. In this paper, we present our new caching strategy adapted to CCN and based on the popularity of content. We show through simulation experiments that our strategy is able to cache less content while it still achieves a higher Cache Hit and outperforms existing default caching strategy in CCN.
Chapter PDF
Similar content being viewed by others
References
Cisco: Cisco visual networking index: Global mobile data traffic forecast update, 2011-2016. Technical report, Cisco (February 2012)
Jacobson, V., Smetters, D.K., Thornton, J.D., Plass, M.F., Briggs, N.H., Braynard, R.L.: Networking named content. In: Proceedings of the 5th International Conference on Emerging Networking Experiments and Technologies, CoNEXT 2009, pp. 1–12. ACM, New York (2009)
Palo Alto Research Center (April 2013), http://www.ccnx.org
Rossi, D., Rossini, G.: Caching performance of content centric networksunder multi-path routing (and more). Technical report, Telecom ParisTech (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 IFIP International Federation for Information Processing
About this paper
Cite this paper
Bernardini, C., Silverston, T., Festor, O. (2013). Cache Management Strategy for CCN Based on Content Popularity. In: Doyen, G., Waldburger, M., Čeleda, P., Sperotto, A., Stiller, B. (eds) Emerging Management Mechanisms for the Future Internet. AIMS 2013. Lecture Notes in Computer Science, vol 7943. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38998-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-38998-6_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38997-9
Online ISBN: 978-3-642-38998-6
eBook Packages: Computer ScienceComputer Science (R0)