Consider a countable list of files updated according to the move-to-front rule. Files have independent random weights, which are used to construct request probabilities. Exact and asymptotic formulas for the Laplace transform of the stationary search cost are given for iid weights. Similar expressions are derived for the first two moments. Some results are extended to the case of independent weights.
Publié le : 2004-07-05
Classification:
move-to-front rule,
random request probabilities,
Laplace transform,
Laplace integral,
AMS 2000 Classification: 68W40, 68P10, 44A10.,
[MATH.MATH-PR]Mathematics [math]/Probability [math.PR],
[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
@article{hal-00005439,
author = {Barrera, Javiera and Paroissin, Christian},
title = {On the distribution of the stationary search cost for the move-to-front rule with random weights},
journal = {HAL},
volume = {2004},
number = {0},
year = {2004},
language = {en},
url = {http://dml.mathdoc.fr/item/hal-00005439}
}
Barrera, Javiera; Paroissin, Christian. On the distribution of the stationary search cost for the move-to-front rule with random weights. HAL, Tome 2004 (2004) no. 0, . http://gdmltest.u-ga.fr/item/hal-00005439/