Efficient analysis of caching strategies under dynamic content popularity
Michele Garetto, Emilio Leonardi, Stefano Traverso

TL;DR
This paper introduces a computationally efficient analytical model for cache performance that accounts for dynamic content popularity, enabling better analysis of caching strategies under realistic traffic conditions.
Contribution
It presents a novel technique to analyze caches with evolving content popularity while maintaining model simplicity and efficiency.
Findings
Effective modeling of dynamic content popularity impacts
Analytical approach captures cache performance accurately
Applicable to various caching strategies
Abstract
In this paper we develop a novel technique to analyze both isolated and interconnected caches operating under different caching strategies and realistic traffic conditions. The main strength of our approach is the ability to consider dynamic contents which are constantly added into the system catalogue, and whose popularity evolves over time according to desired profiles. We do so while preserving the simplicity and computational efficiency of models developed under stationary popularity conditions, which are needed to analyze several caching strategies. Our main achievement is to show that the impact of content popularity dynamics on cache performance can be effectively captured into an analytical model based on a fixed content catalogue (i.e., a catalogue whose size and objects' popularity do not change over time).
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 · Opportunistic and Delay-Tolerant Networks · Peer-to-Peer Network Technologies
