Optimal timer-based caching policies for general arrival processes

Andres Ferragut (), Ismael Rodriguez () and Fernando Paganini ()
Additional contact information
Andres Ferragut: Universidad ORT Uruguay
Ismael Rodriguez: Universidad ORT Uruguay
Fernando Paganini: Universidad ORT Uruguay

Queueing Systems: Theory and Applications, 2018, vol. 88, issue 3, No 2, 207-241

Abstract: Abstract In this paper, we analyze the hit performance of cache systems that receive file requests with general arrival distributions and different popularities. We consider timer-based policies, with differentiated timers over which we optimize. The optimal policy is shown to be related to the monotonicity of the hazard rate function of the interarrival distribution. In particular, for decreasing hazard rates, timer policies outperform the static policy of caching the most popular contents. We provide explicit solutions for the optimal policy in the case of Pareto-distributed inter-request times and a Zipf distribution of file popularities, including a compact fluid characterization in the limit of a large number of files. We compare it through simulation with classical policies, such as Least Recently Used and discuss its performance.

Keywords: Cache systems; Heavy tails; Optimization; 90B18; 90C25; 68M20 (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s11134-017-9540-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:queues:v:88:y:2018:i:3:d:10.1007_s11134-017-9540-3

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/11134/

DOI: 10.1007/s11134-017-9540-3

Access Statistics for this article

Queueing Systems: Theory and Applications is currently edited by Sergey Foss

More articles in Queueing Systems: Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().