Optimal timer-based caching policies for general arrival processes

DOI10.1007/S11134-017-9540-3zbMath1391.90139OpenAlexW2735970336MaRDI QIDQ1649968

Andres Ferragut, Fernando Paganini, Ismael Rodríguez

Publication date: 29 June 2018

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11134-017-9540-3

zbMATH Keywords

optimizationheavy tailscache systems

Mathematics Subject Classification ID

Convex programming (90C25) Communication networks in operations research (90B18) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Uses Software

• CVX

Cites Work

• Unnamed Item
• Unnamed Item
• Transient and steady-state regime of a family of list-based cache replacement algorithms
• Limits and rates of convergence for the distribution of search cost under the move-to-front rule
• Least-recently-used caching with dependent requests
• The limiting move-to-front search-cost in law of large numbers asymptotic regimes
• Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities
• On the Gittins index in the M/G/1 queue
• The persistent-access-caching algorithm
• Critical sizing of LRU caches with dependent requests
• A Unified Approach to the Evaluation of a Class of Replacement Algorithms

This page was built for publication: Optimal timer-based caching policies for general arrival processes