Prefetching and caching for minimizing service costs: Optimal and approximation strategies

Strategically prefetching data has been utilized in practice to improve caching performance. Apart from caching data items upon requests, they can be prefetched into the cache before requests actually occur. The caching and prefetching operations compete for the limited cache space, whose size is typically much smaller than the number of data items. A key question is how to design an optimal prefetching and caching policy, assuming that the future requests can be predicted to certain extend. This question is non-trivial even under an idealized assumption that the future requests are precisely known. To investigate this problem, we propose a cost-based service model. The objective is to find the optimal offline prefetching and caching policy that minimizes the accumulated cost for a given request sequence. By casting it as a min-cost flow problem, we are able to find the optimal policy for a data trace of length N in expected time O(N-3/2) via flow-based algorithms. However, this requires the entire trace for each request and cannot be applied in real time. To this end, we analytically characterize the optimal policy by obtaining an optimal cache eviction mechanism. We derive conditions under which proactive prefetching is a better choice than passive caching. Based on these insights, we propose a lightweight approximation policy that only exploits predictions in the near future. Moreover, the approximation policy can be applied in real time and processes the entire trace in O(N) expected time. We prove that the competitive ratio of the approximation policy is less than root 2. Extensive simulations verify its near-optimal performance, for both heavy and light-tailed popularity distributions. (c) 2020 Elsevier B.V. All rights reserved.

Automated summary

The text discusses the strategic prefetching of data to improve caching performance and the design of optimal prefetching and caching policies. Utilizing a cost-based service model and a lightweight approximation policy, a real-time and near-optimal approach is proposed for cache eviction mechanisms. Extensive simulations verify its performance under various popularity distributions.