On the distribution of the search cost for the move-to-front rule with random weights

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 formulae for the Laplace transform of the stationary search cost are given for i.i.d. weights. Similar expressions are derived for the first two moments. Some results are extended to the case of independent weights.

[1]  John McCabe,et al.  On Serial Files with Relocatable Records , 1965 .

[2]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[3]  W. J. Hendricks.  The stationary distribution of an interesting Markov chain , 1972, Journal of Applied Probability.

[4]  T. Rolski.  On random discrete distributions , 1980 .

[5]  Micha Hofri,et al.  On the Optimality of the Counter Scheme for Dynamic Linear Lists , 1991, Inf. Process. Lett..

[6]  P. Donnelly.  The heaps process, libraries, and size-biased permutations , 1991 .

[7]  Philippe Flajolet,et al.  Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search , 1992, Discret. Appl. Math..

[8]  M. Hofri.  Analysis of Algorithms: Computational Methods & Mathematical Tools , 1995 .

[9]  James Allen Fill,et al.  On the distribution of search cost for the move-to-front rule , 1996, Random Struct. Algorithms.

[10]  J. Pitman,et al.  Random Discrete Distributions Derived from Self-Similar Random Sets , 1996 .

[11]  James Allen Fill,et al.  Limits and Rates of Convergence for the Distribution of Search Cost Under the Move-to-Front Rule , 1996, Theor. Comput. Sci..

[12]  Cost of searching: probabilistic analysis of the self-organizing move-to-front and move -to-root sorting rules , 1997 .

[13]  Shahar Boneh,et al.  Asymptotics for the random coupon collector problem , 1998 .

[14]  P. Jelenkovic.  Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities , 1999 .

[15]  S. Orszag,et al.  Advanced mathematical methods for scientists and engineers I: asymptotic methods and perturbation theory. , 1999 .

[16]  Lars Holst,et al.  Extreme Value Distributions for Random Coupon Collector and Birthday Problems , 2001 .

[17]  Timothy J. Purcell.  Sorting and searching , 2005, SIGGRAPH Courses.