Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities

Abstract

Consider a finite list of items n = 1, 2, . . . , N, that are requested according to an i.i.d. process. Each time an item is requested it is moved to the front of the list. The associated search cost CN for accessing an item is equal to its position before being moved. If the request distribution converges to a proper distribution as N → ∞, then the stationary search cost CN converges in distribution to a limiting search cost C. We show that, when the (limiting) request distribution has a heavy tail (e.g., generalized Zipf's law), ℙ[R = n] ∼ c/nα as n → ∞, α > 1, then the limiting stationary search cost distribution ℙ[C > n], or, equivalently, the least-recently used (LRU) caching fault probability, satisfies limn→∞ ℙ[C > n]/ℙ[R >n] = (1 - -/α)[Γ(1 - 1/α)]α ↗ eγ as α → ∞, where Γ is the Gamma function and γ (= 0.5772 . . .) is Euler's constant. When the request distribution has a light tail ℙ[R = n] ∼ c exp(-λnβ) as n → ∞ (c, λ, β > 0), then limn→∞ ℙ[Cf > n]/ℙ[R > n] = eγ, independently of c, λ, β, where Cf is a fluid approximation of C. We experimentally demonstrate that the derived asymptotic formulas yield accurate results for lists of finite sizes. This should be contrasted with the exponential computational complexity of Burville and Kingman's exact expression for finite lists. The results also imply that the fault probability of LRU caching is asymptotically at most a factor eγ (≈ 1.78) greater than for the optimal static arrangement.