Distributed Cache Management in Information-Centric Networks

The main promise of current research efforts in the area of Information-Centric Networking (ICN) architectures is to optimize the dissemination of information within transient communication relationships of endpoints. Efficient caching of information is key to delivering on this promise. In this paper, we look into achieving this promise from the angle of managed replication of information. Management decisions are made in order to efficiently place replicas of information in dedicated storage devices attached to nodes of the network. In contrast to traditional off-line external management systems we adopt a distributed autonomic management architecture where management intelligence is placed inside the network. Particularly, we present an autonomic cache management approach for ICNs, where distributed managers residing in cache-enabled nodes decide on which information items to cache. We propose four on-line intra-domain cache management algorithms with different level of autonomicity and compare them with respect to performance, complexity, execution time and message exchange overhead. Additionally, we derive a lower bound of the overall network traffic cost for a certain category of network topologies. Our extensive simulations, using realistic network topologies and synthetic workload generators, signify the importance of network wide knowledge and cooperation.

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

[2]  Nikolaos Laoutaris,et al.  Distributed Selfish Replication , 2006, IEEE Transactions on Parallel and Distributed Systems.

[3]  Daniel Grosu,et al.  A Distributed Algorithm for the Replica Placement Problem , 2011, IEEE Transactions on Parallel and Distributed Systems.

[4]  Filip De Turck,et al.  Non-commercial Research and Educational Use including without Limitation Use in Instruction at Your Institution, Sending It to Specific Colleagues That You Know, and Providing a Copy to Your Institution's Administrator. All Other Uses, Reproduction and Distribution, including without Limitation Comm , 2022 .

[5]  Matthew Roughan,et al.  The Internet Topology Zoo , 2011, IEEE Journal on Selected Areas in Communications.

[6]  Daniel Pérez Palomar,et al.  A tutorial on decomposition methods for network utility maximization , 2006, IEEE Journal on Selected Areas in Communications.

[7]  Leandros Tassiulas,et al.  Storage planning and replica assignment in content-centric publish/subscribe networks , 2011, Comput. Networks.

[8]  Venkata N. Padmanabhan,et al.  The content and access dynamics of a busy web site: findings and implicatins , 2000, SIGCOMM.

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

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

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

[12]  Sudipto Guha,et al.  Improved combinatorial algorithms for the facility location and k-median problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[13]  A. Hora,et al.  Distance-Regular Graphs , 2007 .

[14]  Peter Scheuermann,et al.  Selection algorithms for replicated Web servers , 1998, PERV.

[15]  M. Newman.  Power laws, Pareto distributions and Zipf's law , 2005 .

[16]  Jussi Kangasharju,et al.  Object replication strategies in content distribution networks , 2002, Comput. Commun..

[17]  Sem C. Borst,et al.  Distributed Caching Algorithms for Content Distribution Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[18]  Jaswinder Pal Singh,et al.  Efficient event routing in content-based publish-subscribe service networks , 2004, IEEE INFOCOM 2004.

[19]  Pablo Rodriguez,et al.  Analysis of web caching architectures: hierarchical and distributed caching , 2001, TNET.

[20]  Chaitanya Swamy,et al.  Approximation Algorithms for Data Placement Problems , 2008, SIAM J. Comput..

[21]  Lili Qiu,et al.  On the placement of Web server replicas , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[22]  Lili Qiu,et al.  The content and access dynamics of a busy Web site: findings and implications , 2000 .

[23]  Sasu Tarkoma,et al.  Optimizing content-based routers: posets and forests , 2006, Distributed Computing.

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

[25]  G. Dantzig.  Discrete-Variable Extremum Problems , 1957 .

[26]  Nisheeth Shrivastava,et al.  Scalable Content-Based Routing in Pub/Sub Systems , 2009, IEEE INFOCOM 2009.

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

[28]  Yuval Shavitt,et al.  Constrained mirror placement on the Internet , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[29]  Li Fan,et al.  Summary cache: a scalable wide-area web cache sharing protocol , 2000, TNET.

[30]  Leandros Tassiulas,et al.  Cache-aware routing in Information-Centric Networks , 2013, 2013 IFIP/IEEE International Symposium on Integrated Network Management (IM 2013).

[31]  Duane Wessels,et al.  Cache Digests , 1998, Comput. Networks.