Performance of the move-to-front algorithm with Markov-modulated request sequences

We study the classical move-to-front (MTF) algorithm for self-organizing lists within the Markov-modulated request (MMR) model. Such models are useful when list accesses are generated within a relatively small set of modes, with the request sequences in each mode being i.i.d. These modes are often called localities of reference and are known to exist in such applications as traffic streams of Ethernet or ATM networks and the locus of control or data accesses of executing computer programs. Our main results are explicit formulas for the mean and variance of the search-cost, the number of accesses required to find a given list element. By adjusting the number of modes, one can use the MMR methodology to trade off the quality of an approximation with the computational effort it requires. Thus, our results provide a useful new tool for evaluating the MTF rule in linear-search applications with correlated request sequences. We illustrate the computations with several examples.

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

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

[3]  Peter J. Denning,et al.  Operating Systems Theory , 1973 .

[4]  James R. Bitner,et al.  Heuristics That Dynamically Organize Data Structures , 1979, SIAM J. Comput..

[5]  Kai Lai Chung,et al.  Markov Chains with Stationary Transition Probabilities , 1961 .

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

[7]  Predrag R. Jelenkovic,et al.  State Learning and Mixing in Entropy of Hidden Markov Processes and the Gilbert-Elliott Channel , 1999, IEEE Trans. Inf. Theory.

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

[9]  Donald E. Knuth,et al.  The art of computer programming: sorting and searching (volume 3) , 1973 .

[10]  Eliane R. Rodrigues.  Convergence to stationary state for a Markov move-to-front scheme , 1995 .

[11]  Valerie Isham,et al.  Non‐Negative Matrices and Markov Chains , 1983 .

[12]  Eliane R. Rodrigues.  THE PERFORMANCE OF THE MOVE-TO-FRONT SCHEME UNDER SOME PARTICULAR FORMS OF MARKOV REQUESTS , 1995 .

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

[14]  Jon Louis Bentley,et al.  Amortized analyses of self-organizing sequential search heuristics , 1985, CACM.

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