Asymptotic Optimality of the Static Frequency Caching in the Presence of Correlated Requests
Predrag R. Jelenkovic, Ana Radovanovic

TL;DR
This paper proves that static frequency caching remains asymptotically optimal even when requests are strongly correlated, extending its known optimality beyond independent request models.
Contribution
It demonstrates that static frequency caching is asymptotically optimal under correlated request patterns, a significant extension of existing results.
Findings
Static frequency caching is asymptotically optimal with correlated requests.
Optimality holds for large cache sizes despite request correlations.
Extends classical results to correlated request scenarios.
Abstract
It is well known that the static caching algorithm that keeps the most frequently requested documents in the cache is optimal in case when documents are of the same size and requests are independent and equally distributed. However, it is hard to develop explicit and provably optimal caching algorithms when requests are statistically correlated. In this paper, we show that keeping the most frequently requested documents in the cache is still optimal for large cache sizes even if the requests are strongly correlated.
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 · Optimization and Search Problems · Advanced Data Storage Technologies
