Approximate Models for General Cache Networks

Many systems employ caches to improve performance. While isolated caches have been studied in-depth, multi-cache systems are not well understood, especially in networks with arbitrary topologies. In order to gain insight into and manage these systems, a low-complexity algorithm for approximating their behavior is required. We propose a new algorithm, termed a-Net, that approximates the behavior of multi-cache networks by leveraging existing approximation algorithms for isolated LRU caches. We demonstrate the utility of a-Net using both per- cache and network-wide performance measures. We also perform factor analysis of the approximation error to identify system parameters that determine the precision of a-Net.

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

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

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

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

[5]  Oliver Heckmann,et al.  On realistic network topologies for simulation , 2003, MoMeTools '03.

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

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

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

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

[10]  S. Zachary,et al.  Loss networks , 2009, 0903.0640.

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

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

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

[14]  Philippe Flajolet,et al.  Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search , 1992, Discret. Appl. Math..

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