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
β¦ 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
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
The Asymptotic Behavior of the Limit Dis
β
Makarov, A. A.
π
Article
π
1988
π
Society for Industrial and Applied Mathematics
π
English
β 399 KB
news : Western launches its purpose-buil
π
Article
π
1997
π
John Wiley and Sons
π
English
β 160 KB
MAGNA CARTAThe Great CharterPreamble
π
Fiction
π
English
β 11 KB
π 18 views