Modelling and Evaluation of CCN-Caching Trees

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.

[1]  Van Jacobson,et al.  Networking named content , 2009, CoNEXT '09.

[2]  Asit Dan,et al.  An approximate analysis of the LRU and FIFO buffer replacement schemes , 1990, SIGMETRICS '90.

[3]  Scott Shenker,et al.  Revisiting IP multicast , 2006, SIGCOMM '06.

[4]  R G Clegg,et al.  A decade of Internet research — advances in models and practices , 2005 .

[5]  Donald F. Towsley,et al.  Approximate Models for General Cache Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[6]  George Pallis,et al.  Insight and perspectives for content delivery networks , 2006, CACM.

[7]  Richard G. Clegg,et al.  A critical look at power law modelling of the Internet , 2009, Comput. Commun..

[8]  Atsushi Iwata,et al.  Coarse-grain replica management strategies for dynamic replication of Web contents , 2004, Comput. Networks.

[9]  Hao Che,et al.  Analysis and design of hierarchical Web caching systems , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[10]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[11]  P. Jelenkovic.  Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities , 1999 .

[12]  Predrag R. Jelenkovic,et al.  Least-recently-used caching with dependent requests , 2004, Theor. Comput. Sci..

[13]  P. Jelenkovic,et al.  Critical sizing of LRU caches with dependent requests , 2006, Journal of Applied Probability.

[14]  ZHANGLi-xia,et al.  A reliable multicast framework for light-weight sessions and application level framing , 1995 .

[15]  Marcel F. Neuts,et al.  Matrix-Geometric Solutions in Stochastic Models , 1981 .

[16]  James F. Kurose,et al.  Breadcrumbs: Efficient, Best-Effort Content Location in Cache Networks , 2009, IEEE INFOCOM 2009.