Characteristic time routing in information centric networks

Information centric networking (ICN) aims to transform todays Internet from a host-centric model to a content-centric one by caching content internally within the network at storage-enabled nodes. Recently, multiple routing and cache management strategies have been proposed [1,2,3,4,5,6] to improve the user-level performance, primarily latency in ICN. In this paper, we define latency as the download time for a piece of content. In this paper, we propose a simple routing strategy that leverages the concept of characteristic time to improve latency. Characteristic time for a content in a cache indicates the amount of time in future a recently accessed content is likely to remain in that cache. Our proposed algorithm namely, Characteristic Time Routing (CTR) uses characteristic time information to forward requests to caches where the content is likely to be found. CTR augments native routing strategies (e.g., Dijkstras algorithm), works with existing cache management and cache replacement policies and thus can be implemented in ICN prototypes with minimal effort. We perform exhaustive simulation in the Icarus simulator [7] using realistic Internet topologies (e.g., GEANT, WIDE, TISCALI, ROCKETFUEL [8]) and demonstrate that the CTR algorithm provides approximately 1050% improvement in latency over state-of-the-art routing and caching management strategies for ICN for a wide range of simulation parameters.

[1]  Michele Garetto,et al.  A unified approach to the performance analysis of caching systems , 2014, INFOCOM.

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

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

[4]  Leandros Tassiulas,et al.  Information resilience through user-assisted caching in disruptive Content-Centric Networks , 2015, 2015 IFIP Networking Conference (IFIP Networking).

[5]  J. J. Garcia-Luna-Aceves,et al.  A fault-tolerant forwarding strategy for interest-based information centric networks , 2015, 2015 IFIP Networking Conference (IFIP Networking).

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

[7]  James F. Kurose,et al.  Congestion-aware caching and search in information-centric networks , 2014, ICN '14.

[8]  George Pavlou,et al.  Hash-routing schemes for information centric networking , 2013, ICN '13.

[9]  Athanasios V. Vasilakos,et al.  CPHR: In-Network Caching for Information-Centric Networking With Partitioning and Hash-Routing , 2016, IEEE/ACM Transactions on Networking.

[10]  Hari Balakrishnan,et al.  Modeling TTL-based Internet caches , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[11]  George Pavlou,et al.  A toolchain for simplifying network simulation setup , 2013, SimuTools.

[12]  Ratul Mahajan,et al.  Measuring ISP topologies with rocketfuel , 2002, TNET.

[13]  Dario Rossi,et al.  A dive into the caching performance of Content Centric Networking , 2012, 2012 IEEE 17th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD).

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

[15]  George Pavlou,et al.  Probabilistic in-network caching for information-centric networks , 2012, ICN '12.

[16]  Yang Li,et al.  A chunk caching location and searching scheme in Content Centric Networking , 2012, 2012 IEEE International Conference on Communications (ICC).

[17]  Leandros Tassiulas,et al.  Replication management and cache-aware routing in information-centric networks , 2014, 2014 IEEE Network Operations and Management Symposium (NOMS).

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

[19]  W. Frank King,et al.  Analysis of Demand Paging Algorithms , 1971, IFIP Congress.

[20]  Donald F. Towsley,et al.  Performance evaluation of hierarchical TTL-based cache networks , 2014, Comput. Networks.

[21]  Yusheng Ji,et al.  PopCache: Cache more or less based on content popularity for information-centric networking , 2013, 38th Annual IEEE Conference on Local Computer Networks.

[22]  Nikolaos Laoutaris,et al.  The LCD interconnection of LRU caches and its analysis , 2006, Perform. Evaluation.

[23]  J. J. Garcia-Luna-Aceves,et al.  Understanding optimal caching and opportunistic caching at "the edge" of information-centric networks , 2014, ICN '14.

[24]  Lazaros Gkatzikis,et al.  Distributed Cache Management in Information-Centric Networks , 2013, IEEE Transactions on Network and Service Management.

[25]  Dario Rossi,et al.  Coupling caching and forwarding: benefits, analysis, and implementation , 2014, ICN '14.

[26]  Jörg Ott,et al.  Pro-Diluvian: Understanding Scoped-Flooding for Content Discovery in Information-Centric Networking , 2015, ICN.

[27]  Alfred V. Aho,et al.  Principles of Optimal Page Replacement , 1971, J. ACM.

[28]  Steve Uhlig,et al.  Providing public intradomain traffic matrices to the research community , 2006, CCRV.

[29]  James F. Kurose,et al.  Information-centric networking: The evolution from circuits to packets to content , 2014, Comput. Networks.

[30]  Rafii.  Empirical and analytical studies of program reference behavior. [Page reference behavior modeling and evaluation of multiprogramming paging systems] , 1976 .

[31]  George Pavlou,et al.  Icarus: a caching simulator for information centric networking (ICN) , 2014, SimuTools.

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

[33]  Yusheng Ji,et al.  Optimal cooperative routing protocol based on prefix popularity for Content Centric Networking , 2014, 39th Annual IEEE Conference on Local Computer Networks.