Abstract
Networking Named Content (NNC) was recently proposed as a new networking paradigm to realise Content Centric Networks (CCNs). The new paradigm changes much about the current Internet, from security and content naming and resolution, to caching at routers, and new flow models. In this paper, we study the caching part of the proposed networking paradigm in isolation from the rest of the suggested features. In CCNs, every router caches packets of content and reuses those that are still in the cache, when subsequently requested. It is this caching feature of CCNs that we model and evaluate in this paper.
Our modelling proceeds both analytically and by simulation. Initially, we develop a mathematical model for a single router, based on continuous time Markov-chains, which assesses the proportion of time a given piece of content is cached. This model is extended to multiple routers with some simple approximations. The mathematical model is complemented by simulations which look at the caching dynamics, at the packet-level, in isolation from the rest of the flow.
The research leading to these results has received funding from the EU FP7 COMET project - Content Mediator Architecture for Content-Aware Networks, under Grant Agreement 248784.
Chapter PDF
References
Breslau, L., et al.: Web caching and zipf-like distributions: Evidence and implications. In: INFOCOM, pp. 126–134 (1999)
Cairano-Gilfedder, C.D., Clegg, R.G.: A decade of internet research: Advances in models and practices. BT Technology Journal 23(4), 115–128 (2005)
Che, H., Wang, Z., Tung, Y.: Analysis and Design of Hierarchical Web Caching Systems. In: INFOCOM, pp. 1416–1424. IEEE, Los Alamitos (2001)
Clegg, R.G., Cairano-Gilfedder, C.D., Zhou, S.: A critical look at power law modelling of the Internet. Computer Communications 33(3), 259–268 (2009)
Dan, A., Towsley, D.: An approximate analysis of the lru and fifo buffer replacement schemes. In: SIGMETRICS 1990, pp. 143–152 (1990)
Floyd, S., et al.: A reliable multicast framework for light-weight sessions and application level framing. IEEE/ACM Trans. Netw. 5, 784–803 (1997), http://dx.doi.org/10.1109/90.650139
Fujita, N., Ishikawa, Y., Iwata, A., Izmailov, R.: Coarse-grain replica management strategies for dynamic replication of web contents. Comput. Netw. 45(1) (2004)
Jacobson, V., Smetters, D.K., Thornton, J.D., Plass, M.F., Briggs, N.H., Braynard, R.L.: Networking Named Content. In: CoNEXT 2009, pp. 1–12. ACM, New York (2009)
Jelenkovic, P.R.: Asymptotic approximation of the move-to-front search cost distribution and least-recently-used caching fault probabilities. The Annals of Applied Probability 9(2) (1999)
Jelenković, P.R., Radovanović, A.: Least-recently-used caching with dependent requests. Theor. Comput. Sci. 326, 293–327 (2004)
Jelenković, P.R., Radovanović, A., Squillante, M.S.: Critical sizing of lru caches with dependent requests. Journal of Applied Probability 43(4), 1013–1027 (2006)
Neuts, M.F.: Probability Distributions of Phase Type. In: Matrix-Geometric Solutions in Stochastic Models: an Algorthmic Approach, ch. 2. Dover Publications Inc., New York (1981)
Pallis, G., Vakali, A.: Insight and perspectives for content delivery networks. Commun. ACM 49(1), 101–106 (2006)
Ratnasamy, S., Ermolinskiy, A., Shenker, S.: Revisiting IP multicast. In: SIGCOMM 2006, pp. 15–26. ACM, New York (2006)
Rosensweig, E.J., Kurose, J.: Breadcrumbs: Efficient, Best-Effort Content Location in Cache Networks. In: INFOCOM, pp. 2631–2635 (2009)
Rosensweig, E.J., Kurose, J., Towsley, D.: Approximate models for general cache networks. In: INFOCOM. IEEE, Los Alamitos (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 IFIP International Federation for Information Processing
About this paper
Cite this paper
Psaras, I., Clegg, R.G., Landa, R., Chai, W.K., Pavlou, G. (2011). Modelling and Evaluation of CCN-Caching Trees. In: Domingo-Pascual, J., Manzoni, P., Palazzo, S., Pont, A., Scoglio, C. (eds) NETWORKING 2011. NETWORKING 2011. Lecture Notes in Computer Science, vol 6640. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20757-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-20757-0_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20756-3
Online ISBN: 978-3-642-20757-0
eBook Packages: Computer ScienceComputer Science (R0)