Latency Guarantees for Caching with Delayed Hits
Keerthana Gurushankar, Noah G. Singer, Bernardo Subercaseaux

TL;DR
This paper analyzes the delayed-hits caching model, providing the first tight theoretical guarantee for the widely used LRU algorithm, showing it is within a factor of O(Zk) of the optimal in terms of latency.
Contribution
It establishes the first competitive ratio bounds for LRU in the delayed-hits caching model, extending understanding of caching under realistic latency conditions.
Findings
LRU is O(Zk)-competitive in delayed-hits caching.
The result applies to all marking algorithms.
Provides theoretical insights into latency guarantees for practical caching algorithms.
Abstract
In the classical caching problem, when a requested page is not present in the cache (i.e., a "miss"), it is assumed to travel from the backing store into the cache "before" the next request arrives. However, in many real-life applications, such as content delivery networks, this assumption is unrealistic. The "delayed-hits" model for caching, introduced by Atre, Sherry, Wang, and Berger, accounts for the latency between a missed cache request and the corresponding arrival from the backing store. This theoretical model has two parameters: the "delay" , representing the ratio between the retrieval delay and the inter-request delay in an application, and the "cache size" , as in classical caching. Classical caching corresponds to , whereas larger values of model applications where retrieving missed requests is expensive. Despite the practical relevance of the delayed-hits…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCaching and Content Delivery · Advanced Data Storage Technologies · Optimization and Search Problems
