IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-0-387-25551-4_13.html
   My bibliography  Save this book chapter

Comparing Locality of Reference — Some Folk Theorems for the Miss Rate and the Output of Caches

In: Performance Evaluation and Planning Methods for the Next Generation Internet

Author

Listed:
  • Armand M. Makowski
  • Sarut Vanichpun

Abstract

The performance of demand-driven caching is known to depend on the locality of reference exhibited by the stream of requests made to the cache. In spite of numerous efforts, no consensus has been reached on how to formalize this notion, let alone on how to compare streams of requests on the basis of their locality of reference. We take on this issue with an eye towards validating operational expectations associated with the notion of locality of reference. We focus on two “folk theorems,” namely (i) The stronger the locality of reference, the smaller the miss rate of the cache; (ii) Good caching is expected to produce an output stream of requests exhibiting less locality of reference than the input stream of requests. We discuss these two folk theorems in the context of a cache operating under a demand-driven replacement policy when document requests are modeled according to the Independent Reference Model (IR.M). We propose to measure strength of locality of reference in a stream of requests through the skewness of its popularity distribution, and to use the notion of majorization to capture this degree of skewness. We show that these folk theorems hold for caches operating under a large class of cache replacement policies, including the optimal policy A0 and the random policy, but may fail under the LRU policy.

Suggested Citation

  • Armand M. Makowski & Sarut Vanichpun, 2005. "Comparing Locality of Reference — Some Folk Theorems for the Miss Rate and the Output of Caches," Springer Books, in: André Girard & Brunilde Sansò & Felisa Vázquez-Abad (ed.), Performance Evaluation and Planning Methods for the Next Generation Internet, chapter 0, pages 333-365, Springer.
    • Handle: RePEc:spr:sprchp:978-0-387-25551-4_13
    DOI: 10.1007/0-387-25551-6_13
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:sprchp:978-0-387-25551-4_13. 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.