An Overview of Analysis Methods and Evaluation Results for Caching Strategies
arXiv:2308.02875 · doi:10.1016/j.comnet.2023.109583
Abstract
We survey analytical methods and evaluation results for the performance assessment of caching strategies. Knapsack solutions are derived, which provide static caching bounds for independent requests and general bounds for dynamic caching under arbitrary request pattern. We summarize Markov- and time-to-live-based solutions, which assume specific stochastic processes for capturing web request streams and timing. We compare the performance of caching strategies with different knowledge about the properties of data objects regarding a broad set of caching demands. The efficiency of web caching must regard benefits for network wide traffic load, energy consumption and quality-of-service aspects in a tradeoff with costs for updating and storage overheads.
arXiv comment25 pages
References in corpus (5)
- Optimal and Scalable Caching for 5G Using Reinforcement Learning of Space-time Popularities
- Time Aware Least Recent Used (TLRU) Cache Management Policy in ICN
- Cache policies for cloud-based systems: To keep or not to keep
- On the Impact of Network Delays on Time-to-Live Caching
- Multi-step LRU: SIMD-based Cache Replacement for Lower Overhead and Higher Precision