论文信息 - THE PERFORMANCE OF THE MOVE-TO-FRONT SCHEME UNDER SOME PARTICULAR FORMS OF MARKOV REQUESTS

THE PERFORMANCE OF THE MOVE-TO-FRONT SCHEME UNDER SOME PARTICULAR FORMS OF MARKOV REQUESTS

The move-to-front scheme is studied taking into account some forms of Markov dependence for the way items are requested. One of the dependences specifically rules out two consecutive requests for the same item. The other is the so-called p-correlation. An expression for the stationary distribution of the sequence of arrangements of items is given in each case. A necessary and sufficient condition for these distributions to belong to a particular class of distributions is also given. The mean search time for an item is calculated for each form of dependence and these are compared with the value obtained in the case of independent requests. Some properties of the sequence of requests are given. Finally, an expression for the variance of the search time is obtained.

Eliane R. Rodrigues

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

[2] James Allen Fill,et al. THE MOVE-TO-FRONT RULE FOR SELF-ORGANIZING LISTS WITH MARKOV DEPENDENT REQUESTS· , 1995 .

[3] John G. Kemeny,et al. Finite Markov chains , 1960 .

[4] Ronald L. Rivest,et al. On self-organizing sequential search heuristics , 1976, CACM.

[5] P. J. Burville,et al. On a model for storage and search , 1973, Journal of Applied Probability.

[6] John G. Kemeny,et al. Finite Markov Chains. , 1960 .

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

[8] W. J. Hendricks. An Account of Self-Organizing Systems , 1976, SIAM J. Comput..

[9] Man-Keung Siu,et al. SELF-ORGANIZING FILES WITH DEPENDENT ACCESSES , 1984 .

[10] J. Kingman. Random Discrete Distributions , 1975 .