IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v88y2018i3d10.1007_s11134-017-9540-3.html
   My bibliography  Save this article

Optimal timer-based caching policies for general arrival processes

Author

Listed:
  • Andres Ferragut

    (Universidad ORT Uruguay)

  • Ismael Rodriguez

    (Universidad ORT Uruguay)

  • Fernando Paganini

    (Universidad ORT Uruguay)

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.

Suggested Citation

  • Andres Ferragut & Ismael Rodriguez & Fernando Paganini, 2018. "Optimal timer-based caching policies for general arrival processes," Queueing Systems: Theory and Applications, Springer, vol. 88(3), pages 207-241, April.
    • Handle: RePEc:spr:queues:v:88:y:2018:i:3:d:10.1007_s11134-017-9540-3
    DOI: 10.1007/s11134-017-9540-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-017-9540-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11134-017-9540-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:queues:v:88:y:2018:i:3:d:10.1007_s11134-017-9540-3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.