NETWORKING 2011: NETWORKING 2011 pp 78-91 | Cite as
Modelling and Evaluation of CCN-Caching Trees
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.
Keywords
Content-Centric Networks Packet Caching Markov ChainsReferences
- 1.Breslau, L., et al.: Web caching and zipf-like distributions: Evidence and implications. In: INFOCOM, pp. 126–134 (1999)Google Scholar
- 2.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)CrossRefGoogle Scholar
- 3.Che, H., Wang, Z., Tung, Y.: Analysis and Design of Hierarchical Web Caching Systems. In: INFOCOM, pp. 1416–1424. IEEE, Los Alamitos (2001)Google Scholar
- 4.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)CrossRefGoogle Scholar
- 5.Dan, A., Towsley, D.: An approximate analysis of the lru and fifo buffer replacement schemes. In: SIGMETRICS 1990, pp. 143–152 (1990)Google Scholar
- 6.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 CrossRefGoogle Scholar
- 7.Fujita, N., Ishikawa, Y., Iwata, A., Izmailov, R.: Coarse-grain replica management strategies for dynamic replication of web contents. Comput. Netw. 45(1) (2004)Google Scholar
- 8.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)CrossRefGoogle Scholar
- 9.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)Google Scholar
- 10.Jelenković, P.R., Radovanović, A.: Least-recently-used caching with dependent requests. Theor. Comput. Sci. 326, 293–327 (2004)MATHCrossRefGoogle Scholar
- 11.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)MathSciNetMATHCrossRefGoogle Scholar
- 12.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)Google Scholar
- 13.Pallis, G., Vakali, A.: Insight and perspectives for content delivery networks. Commun. ACM 49(1), 101–106 (2006)CrossRefGoogle Scholar
- 14.Ratnasamy, S., Ermolinskiy, A., Shenker, S.: Revisiting IP multicast. In: SIGCOMM 2006, pp. 15–26. ACM, New York (2006)CrossRefGoogle Scholar
- 15.Rosensweig, E.J., Kurose, J.: Breadcrumbs: Efficient, Best-Effort Content Location in Cache Networks. In: INFOCOM, pp. 2631–2635 (2009)Google Scholar
- 16.Rosensweig, E.J., Kurose, J., Towsley, D.: Approximate models for general cache networks. In: INFOCOM. IEEE, Los Alamitos (2010)Google Scholar