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 analysisheavy-tailed distributionsleast-recently-used cachingcache fault probabilityleast-frequently-used cachingWeb cachinggeneralized Zipf's law distributionsmove-to-front searchingpersistent-access-caching

Mathematics Subject Classification ID

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

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)

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

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)