The persistent-access-caching algorithm
From MaRDI portal
Publication:3522837
DOI10.1002/rsa.20214zbMath1156.68614OpenAlexW4247826844MaRDI 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 distributionsaverage-case analysisleast-recently-used cachingweb cachingcache fault probabilityleast-frequently-used cachinggeneralized Zipf's law distributionsmove-to-front searchingpersistent-access-caching
Related Items (7)
Comparison of subdominant eigenvalues of some linear search schemes ⋮ Optimal timer-based caching policies for general arrival processes ⋮ Limiting behaviour of the stationary search cost distribution driven by a generalized gamma process ⋮ The limiting move-to-front search-cost in law of large numbers asymptotic regimes ⋮ Stochastic ranking process with time dependent intensities ⋮ A fluid limit for a cache algorithm with general request processes ⋮ Asymptotic optimality of the static frequency caching in the presence of correlated requests
Cites Work
This page was built for publication: The persistent-access-caching algorithm
