Limiting search cost distribution for the move-to-front rule with random request probabilities - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Operations Research Letters Année : 2006

Limiting search cost distribution for the move-to-front rule with random request probabilities

Résumé

Consider a list of $n$ files whose popularities are random. These files are updated according to the move-to-front rule and we consider the induced Markov chain at equilibrium. We give the exact limiting distribution of the search-cost per item as $n$ tends to infinity. Some examples are supplied.
Fichier principal
Vignette du fichier
mtf2.pdf (78.37 Ko) Télécharger le fichier

Dates et versions

hal-00005427 , version 1 (17-06-2005)

Identifiants

Citer

Javiera Barrera, Thierry Huillet, Christian Paroissin. Limiting search cost distribution for the move-to-front rule with random request probabilities. Operations Research Letters, 2006, 34, pp.557-563. ⟨10.1016/j.orl.2005.09.007⟩. ⟨hal-00005427⟩
91 Consultations
192 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More