Exact analysis of TTL cache networks

TTL caching models have recently regained significant research interest due to their connection to popular caching policies such as LRU. This paper advances the state-of-the-art analysis of TTL-based cache networks by developing two exact methods with orthogonal generality and computational complexity. The first method generalizes existing results for line networks under renewal requests to the broad class of caching policies whereby evictions are driven by stopping times; in addition to classical policies used in DNS and web caching, our stopping time model captures an emerging new policy implemented in SDN switches and Amazon web services. The second method further generalizes these results to feedforward networks with Markov arrival process (MAP) requests. MAPs are particularly suitable for non-line networks because they are closed not only under superposition and splitting, as known, but also under caching operations with phase-type (PH) TTL distributions. The crucial benefit of the two closure properties is that they jointly enable the first exact analysis of TTL feedforward cache networks in great generality. Moreover, numerical results highlight that existing Poisson approximations in binary-tree topologies are subject to relative errors as large as 30%, depending on the tree depth.

[1]  Amir Dembo,et al.  Large Deviations Techniques and Applications , 1998 .

[2]  Dieter Baum,et al.  An introduction to queueing theory and matrix-analytic methods , 2005 .

[3]  Giuliano Casale.  Building accurate workload models using Markovian arrival processes , 2011, SIGMETRICS '11.

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

[5]  A. Gut.  Stopped Random Walks: Limit Theorems and Applications , 1987 .

[6]  J. Norris.  Appendix: probability and measure , 1997 .

[7]  Igor Tatarinov,et al.  Static caching in Web servers , 1997, Proceedings of Sixth International Conference on Computer Communications and Networks.

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

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

[10]  Florin Ciucu,et al.  Exact analysis of TTL cache networks: the case of caching policies driven by stopping times , 2014, SIGMETRICS '14.

[11]  Søren Asmussen,et al.  Matrix‐analytic Models and their Analysis , 2000 .

[12]  Michele Garetto,et al.  A unified approach to the performance analysis of caching systems , 2013, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[13]  Peter Buchholz.  The Nsolve Program , 2010 .

[14]  Henk A. van der Vorst,et al.  Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems , 1992, SIAM J. Sci. Comput..

[15]  Edith Cohen,et al.  Aging through cascaded caches: performance issues in the distribution of web content , 2001, SIGCOMM.

[16]  Yijia Lin,et al.  Multivariate Exponential Tilting and Pricing Implications for Mortality Securitization , 2006 .

[17]  M. Neuts,et al.  A SINGLE-SERVER QUEUE WITH SERVER VACATIONS AND A CLASS OF NON-RENEWAL ARRIVAL PROCESSES , 1990 .

[18]  Jianping Pan,et al.  On expiration-based hierarchical caching systems , 2004, IEEE Journal on Selected Areas in Communications.

[19]  Philippe Robert,et al.  Impact of traffic mix on caching performance in a content-centric network , 2012, 2012 Proceedings IEEE INFOCOM Workshops.

[20]  A. Palmboom,et al.  Analysis of Demand Paging Algorithms , 1972, GI Jahrestagung.

[21]  Edith Cohen,et al.  Performance Aspects of Distributed Caches Using TTL-Based Consistency , 2001, ICALP.

[22]  Huyên Pham.  Some Applications and Methods of Large Deviations in Finance and Insurance , 2007 .

[23]  Armand M. Makowski,et al.  Measuring consistency in TTL-based caches , 2005, Perform. Evaluation.

[24]  Predrag R. Jelenkovic,et al.  Characterizing the miss sequence of the LRU cache , 2008, PERV.

[25]  Sara Alouf,et al.  Modeling modern DNS caches , 2013, VALUETOOLS.

[26]  Erol Gelenbe,et al.  A Unified Approach to the Evaluation of a Class of Replacement Algorithms , 1973, IEEE Transactions on Computers.

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

[28]  M. Musiela,et al.  Martingale Methods in Financial Modelling , 2002 .

[29]  Bo Friis Nielsen.  Note on the Markovian Arrival Process for 04141 Stochastic Processes , .

[30]  Giuseppe Bianchi,et al.  Check before storing: what is the performance price of content integrity verification in LRU caching? , 2013, CCRV.

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

[32]  Sلأren Asmussen,et al.  Applied Probability and Queues , 1989 .

[33]  Don Towsley,et al.  An approximate analysis of heterogeneous and general cache networks , 2014 .

[34]  Evgenia Smirni,et al.  Bound analysis of closed queueing networks with workload burstiness , 2008, SIGMETRICS '08.

[35]  James Roberts,et al.  Exploring the memory-bandwidth tradeoff in an information-centric network , 2013, Proceedings of the 2013 25th International Teletraffic Congress (ITC).

[36]  A. Gut.  Stopped Random Walks , 1987 .

[37]  Luigi Rizzo,et al.  Replacement policies for a proxy cache , 2000, TNET.

[38]  Ronald Fagin,et al.  Efficient Calculation of Expected Miss Ratios in the Independent Reference Model , 1978, SIAM J. Comput..

[39]  Philippe Robert,et al.  A versatile and accurate approximation for LRU cache performance , 2012, 2012 24th International Teletraffic Congress (ITC 24).

[40]  Ramesh K. Sitaraman,et al.  Overlay Networks: An Akamai Perspective , 2014 .

[41]  Yousef Saad,et al.  Iterative methods for sparse linear systems , 2003 .

[42]  P. Jelenkovic.  Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities , 1999 .

[43]  S. Asmussen,et al.  Marked point processes as limits of Markovian arrival streams , 1993 .

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

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

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