The persistent-access-caching algorithm
From MaRDI portal
Publication:3522837
DOI10.1002/rsa.20214zbMath1156.68614MaRDI QIDQ3522837
Predrag R. Jelenković, Ana Radovanović
Publication date: 4 September 2008
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20214
heavy-tailed distributions; average-case analysis; least-recently-used caching; web caching; cache fault probability; least-frequently-used caching; generalized Zipf's law distributions; move-to-front searching; persistent-access-caching
68W05: Nonnumerical algorithms
Related Items
Stochastic ranking process with time dependent intensities, Comparison of subdominant eigenvalues of some linear search schemes, The limiting move-to-front search-cost in law of large numbers asymptotic regimes, Asymptotic optimality of the static frequency caching in the presence of correlated requests, 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
Cites Work