Modeling data transfer in content-centric networking

Content-centric networking proposals, as Parc's CCN, have recently emerged to define new network architectures where content, and not its location, becomes the core of the communication model. These new paradigms push data storage and delivery at network layer and are designed to better deal with current Internet usage, mainly centered around content dissemination and retrieval. In this paper, we develop an analytical model of CCN in-network storage and receiver-driven transport, that more generally applies to a class of content ori ented networks identified by chunk-based communication. We derive a closed-form expression for the mean stationary throughput as a function of hit/miss probabilities at the caches along the path, of content popularity and of content/cache size. Our analytical results, supported by chunk level simulations, can be used to analyze fundamental trade-offs in current CCN architecture, and provide an essential building block for the design and evaluation of enhanced CCN protocols.

[1]  Predrag R. Jelenkovic,et al.  Performance of the move-to-front algorithm with Markov-modulated request sequences , 1999, Oper. Res. Lett..

[2]  Predrag R. Jelenkovic,et al.  Characterizing the miss sequence of the LRU cache , 2008, PERV.

[3]  Edward Chlebus,et al.  Nonstationary Poisson modeling of web browsing session arrivals , 2007, Inf. Process. Lett..

[4]  Jörg Ott,et al.  On content-centric router design and implications , 2010, ReARCH '10.

[5]  Scott Shenker,et al.  A data-oriented (and beyond) network architecture , 2007, SIGCOMM '07.

[6]  Diego Perino,et al.  Experimental Evaluation of Memory Management in Content-Centric Networking , 2011, 2011 IEEE International Conference on Communications (ICC).

[7]  Massimo Gallo,et al.  Modeling data transfer in content-centric networking ( extended version ) , 2011 .

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

[9]  Seungjoon Lee,et al.  Anycast-aware transport for content delivery networks , 2009, WWW '09.

[10]  Philippe Flajolet,et al.  Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search , 1992, Discret. Appl. Math..

[11]  Alexander L. Wolf,et al.  A routing scheme for content-based networking , 2004, IEEE INFOCOM 2004.

[12]  Thomas E. Stern,et al.  Analysis of separable Markov-modulated rate models for information-handling systems , 1991, Advances in Applied Probability.

[13]  Uichin Lee,et al.  Greening the internet with content-centric networking , 2010, e-Energy.

[14]  David Tse,et al.  Probabilistic methods for web caching , 2001, Perform. Evaluation.

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

[16]  KyoungSoo Park,et al.  Scale and Performance in the CoBlitz Large-File Distribution Service , 2006, NSDI.

[17]  Ludmila Cherkasova,et al.  Characterizing locality, evolution, and life span of accesses in enterprise media server workloads , 2002, NOSSDAV '02.