Cache-aware routing in Information-Centric Networks

Information-Centric Networking (ICN) has attracted the attention of the research community, which has argued that content, instead of end-points, must be at the center stage of attention. The research issues addressed by most of the proposed architectures are related to persistent/unique naming, efficient content distribution, in-network caching and security. Despite the emergence of ICN-oriented solutions, little attention has been given on designing efficient routing mechanisms suitable for ICNs since most of the approaches assume either traditional shortest path or inefficient flooding schemes. In this paper, we first describe how a resource management system can be deployed on two of the most fermentative ICN network architectures and we propose a cache-aware routing scheme that calculate the paths with the minimum transportation cost based on the information item demands and the caching capabilities of the network. We present a Dynamic Programming approach for calculating the paths and we validate the proposed approach through simulations.

[1]  George Pavlou,et al.  Cache "Less for More" in Information-Centric Networks , 2012, Networking.

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

[3]  Hanspeter Bieri,et al.  Modeling the Topology of the Internet An Assessment Pascal Habegger and , 2002 .

[4]  Daniel Massey,et al.  Routing policies in named data networking , 2011, ICN '11.

[5]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[6]  Massimo Gallo,et al.  Bandwidth and storage sharing performance in information centric networking , 2011, ICN '11.

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

[8]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[9]  Lada A. Adamic,et al.  Zipf's law and the Internet , 2002, Glottometrics.

[10]  Masayuki Murata,et al.  CATT: potential based routing with content caching for ICN , 2012, ICN '12.

[11]  Ning Wang,et al.  Curling: Content-ubiquitous resolution and delivery infrastructure for next-generation services , 2011, IEEE Communications Magazine.

[12]  Diego Perino,et al.  A reality check for content centric networking , 2011, ICN '11.

[13]  Bernhard Plattner,et al.  Service discovery in mobile ad hoc networks: a field theoretic approach , 2005, Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks.

[14]  Hang Liu,et al.  A multi-level DHT routing framework with aggregation , 2012, ICN '12.

[15]  Nikolaos Laoutaris.  A Closed-Form Method for LRU Replacement under Generalized Power-Law Demand , 2007, ArXiv.

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

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

[18]  Lazaros Gkatzikis,et al.  Autonomic cache management in Information-Centric Networks , 2012, 2012 IEEE Network Operations and Management Symposium.

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