The persistent-access-caching algorithm

DOI10.1002/RSA.20214MaRDI QIDQ3522837zbMATH OpenOpenAlexFDO

Authors Predrag R. Jelenković, Ana Radovanović

Publication date 4 September 2008

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rsa.20214

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

Nonnumerical algorithms (68W05)

Recommendations

• Near optimality of the discrete persistent access caching algorithm
• Probabilistic methods for web caching
• LRU caching with moderately heavy request distributions
• Optimizing LRU Caching for Variable Document Sizes
• Exploiting regularities in web traffic patterns for cache replacement

Cited in

(16)

• Asymptotic optimality of the static frequency caching in the presence of correlated requests
• On caching effectiveness of web clusters under persistent connections.
• Caching policy design and cache allocation in active reliable multicast.
• Optimal timer-based caching policies for general arrival processes
• Limiting behaviour of the stationary search cost distribution driven by a generalized gamma process
• A fluid limit for a cache algorithm with general request processes
• Transient and steady-state regime of a family of list-based cache replacement algorithms
• scientific article; zbMATH DE number 1755595 (Why is no real title available?)
• Optimizing LRU Caching for Variable Document Sizes
• Analysis of LRU cache trees with a power law reference distribution
• scientific article; zbMATH DE number 1897128 (Why is no real title available?)
• Stochastic ranking process with time dependent intensities
• Near optimality of the discrete persistent access caching algorithm
• Least-recently-used caching with dependent requests
• Comparison of subdominant eigenvalues of some linear search schemes
• The limiting move-to-front search-cost in law of large numbers asymptotic regimes

This page was built for publication: The persistent-access-caching algorithm

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