Near optimality of the discrete persistent access caching algorithm

MaRDI QIDQ5485326zbMATH OpenFDO

Authors Predrag R. Jelenković, Xiaozhu Kang, Ana Radovanović

Publication date 29 August 2006

zbMATH Keywords

average-case analysiscache fault probabilitygeneralized Zipf's law distributionsheavy-tailed distributionsleast-frequently-used cachingleast-recently-used cachingmove-to-front searchingpersistent-access-cachingWeb caching

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Analysis of algorithms (68W40)

Recommendations

• The persistent-access-caching algorithm
• Probabilistic methods for web caching
• Asymptotic optimality of the static frequency caching in the presence of correlated requests
• Optimizing LRU Caching for Variable Document Sizes
• Least-recently-used caching with dependent requests

Cited in

(6)

• Optimal timer-based caching policies for general arrival processes
• Exploiting regularities in web traffic patterns for cache replacement
• The persistent-access-caching algorithm
• All or Nothing Caching Games with Bounded Queries
• A short proof of optimality for the MIN cache replacement algorithm
• Another short proof of optimality for the MIN cache replacement algorithm

This page was built for publication: Near optimality of the discrete persistent access caching algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5485326)