Asymptotic optimality of the static frequency caching in the presence of correlated requests
From MaRDI portal
Publication:1038095
DOI10.1016/J.ORL.2009.03.011zbMATH Open1173.90491arXiv0903.4898OpenAlexW72791367MaRDI QIDQ1038095FDOQ1038095
Authors: Predrag R. Jelenković, Ana Radovanović 
Publication date: 17 November 2009
Published in: Operations Research Letters (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/0903.4898
Recommendations
long-range dependenceaverage-case analysisleast-recently-used cachingweb cachingcache fault probabilityleast-frequently-used caching
Cites Work
Cited In (2)
This page was built for publication: Asymptotic optimality of the static frequency caching in the presence of correlated requests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1038095)
