Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1143338 | Operations Research Letters | 2006 | 7 Pages |
Abstract
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 the largest search cost.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Javiera Barrera, Thierry Huillet, Christian Paroissin,