𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Fabrizio Leisen; Antonio Lijoi; Christian Paroissin


Book ID
116890293
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
226 KB
Volume
81
Category
Article
ISSN
0167-7152

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Limiting search cost distribution for th
✍ Javiera Barrera; Thierry Huillet; Christian Paroissin πŸ“‚ Article πŸ“… 2006 πŸ› Elsevier Science 🌐 English βš– 181 KB

Consider a list of n files whose popularities are random. The list is updated according to the move-to-front rule. When the induced Markov chain is at equilibrium, we explicitly compute the limiting distribution of the search-cost per item as n tends to infinity. The uniform distribution results in

On the distribution of search cost for t
✍ James Allen Fill; Lars Holst πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 393 KB πŸ‘ 1 views

A file of records, each with an associated request probability, is dynamically maintained as a serial list. Successive requests are mutually independent. The list is reordered according to the move-to-front (MTF) rule: The requested record is moved to the front of the list. We derive the stationary