On the steady-state of cache networks

Over the past few years Content-Centric Networking, a networking model in which host-to-content communication protocols are introduced, has been gaining much attention. A central component of such an architecture is a large-scale interconnected caching system. To date, the way these Cache Networks operate and perform is still poorly understood. In this work, we demonstrate that certain cache networks are non-ergodic in that their steady-state characterization depends on the initial state of the system. We then establish several important properties of cache networks, in the form of three independently-sufficient conditions for a cache network to comprise a single ergodic component. Each property targets a different aspect of the system - topology, admission control and cache replacement policies. Perhaps most importantly we demonstrate that cache replacement can be grouped into equivalence classes, such that the ergodicity (or lack-thereof) of one policy implies the same property holds for all policies in the class.

[1]  Robert J. T. Morris,et al.  Exact Analysis of Bernoulli Superposition of Streams Into a Least Recently Used Cache , 1995, IEEE Trans. Software Eng..

[2]  Yuanyuan Zhou,et al.  Second-level buffer cache management , 2004, IEEE Transactions on Parallel and Distributed Systems.

[3]  Massimo Gallo,et al.  Performance evaluation of the random replacement policy for networks of caches , 2012, SIGMETRICS '12.

[4]  Stratis Ioannidis,et al.  Absence of Evidence as Evidence of Absence: A Simple Mechanism for Scalable P2P Search , 2009, IEEE INFOCOM 2009.

[5]  Xueyan Tang,et al.  Coordinated En-Route Web Caching , 2002, IEEE Trans. Computers.

[6]  Karen R. Sollins,et al.  Arguments for an information-centric internetworking architecture , 2010, CCRV.

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

[8]  Stratis Ioannidis,et al.  On the design of hybrid peer-to-peer systems , 2008, SIGMETRICS '08.

[9]  Michael Dahlin,et al.  Coordinated Placement and Replacement for Large-Scale Distributed Caches , 2002, IEEE Trans. Knowl. Data Eng..

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

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

[12]  Carey L. Williamson,et al.  On filter effects in web caching hierarchies , 2002, TOIT.

[13]  Ioannis Stavrakakis,et al.  Approximate analysis of LRU in the case of short term correlations , 2008, Comput. Networks.

[14]  Carey L. Williamson,et al.  Simulation evaluation of a heterogeneous Web proxy caching hierarchy , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[15]  Asit Dan,et al.  A simple analysis of the LRU buffer policy and its relationship to buffer warm-up transient , 1993, Proceedings of IEEE 9th International Conference on Data Engineering.

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

[17]  Gang Peng,et al.  CDN: Content Distribution Network , 2004, ArXiv.

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

[19]  Richa Gupta,et al.  A Paramount Pair of Cache Replacement Algorithms on L1 and L2 Using Multiple Databases with Security , 2009, 2009 Second International Conference on Emerging Trends in Engineering & Technology.

[20]  Kostas Pentikousis,et al.  A multiaccess network of information , 2010, 2010 IEEE International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM).

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

[22]  Leonard Kleinrock,et al.  Proportional Replication in Peer-to-Peer Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[23]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[24]  John G. Kemeny,et al.  Finite Markov chains , 1960 .

[25]  George C. Polyzos,et al.  A Hybrid Overlay Multicast and Caching Scheme for Information-Centric Networking , 2010, 2010 INFOCOM IEEE Conference on Computer Communications Workshops.

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

[27]  Virgílio A. F. Almeida,et al.  On the intrinsic locality properties of Web reference streams , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[28]  Ethan L. Miller,et al.  Design and management of globally distributed network caches , 2004 .

[29]  Diana K. Smetters,et al.  VoCCN: voice-over content-centric networks , 2009, ReArch '09.

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

[31]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

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

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

[34]  S. RaijaSulthana.  Distributed caching algorithms for content distribution networks , 2015 .

[35]  George Pavlou,et al.  Modelling and Evaluation of CCN-Caching Trees , 2011, Networking.