IDEAS home Printed from https://ideas.repec.org/a/eee/stapro/v81y2011i12p1827-1832.html
   My bibliography  Save this article

Limiting behavior of the search cost distribution for the move-to-front rule in the stable case

Author

Listed:
  • Leisen, Fabrizio
  • Lijoi, Antonio
  • Paroissin, Christian

Abstract

Move-to-front rule is a heuristic updating a list of n items according to requests. Items are required with unknown probabilities (or popularities). The induced Markov chain is known to be ergodic. A main problem is the study of the distribution of the search cost defined as the position of the required item. Here we first establish the link between two recent papers of Barrera and Paroissin and Lijoi and Pruenster that both extend the results proved by Kingman on the expected stationary search cost. By combining the results contained in these papers, we obtain the limiting behavior for any moments of the stationary search cost as n tends to infinity.

Suggested Citation

  • Leisen, Fabrizio & Lijoi, Antonio & Paroissin, Christian, 2011. "Limiting behavior of the search cost distribution for the move-to-front rule in the stable case," Statistics & Probability Letters, Elsevier, vol. 81(12), pages 1827-1832.
    • Handle: RePEc:eee:stapro:v:81:y:2011:i:12:p:1827-1832
    DOI: 10.1016/j.spl.2011.07.016
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167715211002471
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.spl.2011.07.016?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.

    References listed on IDEAS

    as
    1. John McCabe, 1965. "On Serial Files with Relocatable Records," Operations Research, INFORMS, vol. 13(4), pages 609-618, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gerhard Hasslinger & Konstantinos Ntougias & Frank Hasslinger & Oliver Hohlfeld, 2023. "Scope and Accuracy of Analytic and Approximate Results for FIFO, Clock-Based and LRU Caching Performance," Future Internet, MDPI, vol. 15(3), pages 1-17, February.
    2. Ryo Hirade & Takayuki Osogami, 2010. "Analysis of Page Replacement Policies in the Fluid Limit," Operations Research, INFORMS, vol. 58(4-part-1), pages 971-984, August.

    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:eee:stapro:v:81:y:2011:i:12:p:1827-1832. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description .

    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.