Affiliation:
1. University of Massachusetts Amherst, USA
2. Inria, France
Abstract
The modeling and analysis of an LRU cache is extremely challenging as exact results for the main performance metrics (e.g., hit rate) are either lacking or cannot be used because of their high computational complexity for large caches. As a result, various approximations have been proposed. The state-of-the-art method is the so-called TTL approximation, first proposed and shown to be asymptotically exact for IRM requests by Fagin [13]. It has been applied to various other workload models and numerically demonstrated to be accurate but without theoretical justification. In this article, we provide theoretical justification for the approximation in the case where distinct contents are described by independent stationary and ergodic processes. We show that this approximation is exact as the cache size and the number of contents go to infinity. This extends earlier results for the independent reference model. Moreover, we establish results not only for the aggregate cache hit probability but also for every individual content. Last, we obtain bounds on the rate of convergence.
Funder
NSF
U.S. ARL and the U.K. MoD
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications,Hardware and Architecture,Safety, Risk, Reliability and Quality,Media Technology,Information Systems,Software,Computer Science (miscellaneous)
Reference28 articles.
1. T. M. Apostol. 1976. Introduction to Analytic Number Theory. Springer-Verlag. T. M. Apostol. 1976. Introduction to Analytic Number Theory. Springer-Verlag.
2. B. Baccelli and P. Brémaud. 2003. Elements of Queueing Theory: Palm Martingale Calculus and Stochastic Recurrences (2nd ed.). Applications of Mathematics Stochastic Modelling and Applied Probability Vol. 26. Springer-Verlag Berlin. B. Baccelli and P. Brémaud. 2003. Elements of Queueing Theory: Palm Martingale Calculus and Stochastic Recurrences (2nd ed.). Applications of Mathematics Stochastic Modelling and Applied Probability Vol. 26. Springer-Verlag Berlin.
3. Exact analysis of TTL cache networks
4. Check before storing
5. Heuristics That Dynamically Organize Data Structures
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献