Latency Guarantees for Caching with Delayed Hits

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" $Z$, representing the ratio between the retrieval delay and the inter-request delay in an application, and the "cache size" $k$, as in classical caching. Classical caching corresponds to $Z=1$, whereas larger values of $Z$ model applications where retrieving missed requests is expensive. Despite the practical relevance of the delayed-hits model, its theoretical underpinnings are still poorly understood. We present the first tight theoretical guarantee for optimizing delayed-hits caching: The "Least Recently Used" algorithm, a natural, deterministic, online algorithm widely used in practice, is $O(Zk)$-competitive, meaning it incurs at most $O(Zk)$ times more latency than the (offline) optimal schedule. Our result extends to any so-called "marking" algorithm.