On the throughput capacity of information-centric networks

Wireless information-centric networks consider storage one of the network primitives, and propose to cache data within the network in order to improve latency to access content and reduce bandwidth consumption. We study the throughput capacity of an information-centric network when the data cached in each node has a limited lifetime. The results show that with some fixed request and cache expiration rates, the network can have the maximum throughput order of 1/√n and 1/log n in cases of grid and random networks, respectively. Comparing these values with the corresponding throughput with no cache capability (1/n and 1/√(n log n) respectively), we can actually quantify the asymptotic advantage of caching. Moreover, since the request rates will decrease as a result of increasing download delays, increasing the content lifetimes according to the network growth may result in higher throughput capacities.

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

[2]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[3]  Hao Che,et al.  Hierarchical Web caching systems: modeling, design and experimental results , 2002, IEEE J. Sel. Areas Commun..

[4]  Cédric Westphal,et al.  On maximizing the lifetime of distributed information in ad-hoc networks with individual constraints , 2005, MobiHoc '05.

[5]  Ankit Singla,et al.  Information-centric networking: seeing the forest for the trees , 2011, HotNets-X.

[6]  Urs Niesen,et al.  Caching in wireless networks , 2009, 2009 IEEE International Symposium on Information Theory.

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

[8]  Martin Raab,et al.  "Balls into Bins" - A Simple and Tight Analysis , 1998, RANDOM.

[9]  Charles E. Perkins,et al.  An Epidemiological Study of Information Dissemination in Mobile Networks. , 2009, 2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

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

[11]  Kostas Pentikousis,et al.  Design considerations for a network of information , 2008, CoNEXT '08.

[12]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

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

[14]  Michele Garetto,et al.  Content-centric wireless networks with limited buffers: When mobility hurts , 2013, 2013 Proceedings IEEE INFOCOM.

[15]  Massimo Gallo,et al.  Modeling data transfer in content-centric networking , 2011, 2011 23rd International Teletraffic Congress (ITC).

[16]  M. Penrose.  The longest edge of the random minimal spanning tree , 1997 .

[17]  Deborah Estrin,et al.  Named Data Networking (NDN) Project , 2010 .

[18]  Urs Niesen,et al.  On Capacity Scaling in Arbitrary Wireless Networks , 2009, IEEE Transactions on Information Theory.

[19]  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).

[20]  Guohong Cao,et al.  Supporting cooperative caching in ad hoc networks , 2004, IEEE Transactions on Mobile Computing.

[21]  Bengt Ahlgren,et al.  A survey of information-centric networking , 2012, IEEE Communications Magazine.

[22]  Robert Tappan Morris,et al.  Capacity of Ad Hoc wireless networks , 2001, MobiCom '01.

[23]  G. Voelker,et al.  On the scale and performance of cooperative Web proxy caching , 2000, OPSR.

[24]  D. Raychaudhuri,et al.  Performance Evaluation of the "Cache-and-Forward (CNF)" Network for Mobile Content Delivery Services , 2009, 2009 IEEE International Conference on Communications Workshops.

[25]  Panganamala Ramana Kumar,et al.  Scaling Laws for Ad Hoc Wireless Networks: An Information Theoretic Approach , 2006, Found. Trends Netw..

[26]  Leandros Tassiulas,et al.  Asymptotic laws for content replication and delivery in wireless networks , 2012, 2012 Proceedings IEEE INFOCOM.

[27]  Gennaro Boggia,et al.  A fairness analysis of content centric networks , 2011, 2011 International Conference on the Network of the Future.

[28]  Edwin K. P. Chong,et al.  Throughput-storage tradeoff in ad hoc networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..