The performance of the move-to-front scheme under some particular forms of Markov requests

DOI10.2307/3215222MaRDI QIDQ4866784zbMATH OpenOpenAlexFDO

Authors Eliane R. Rodrigues

Publication date 28 May 1996

Published in Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/3215222

zbMATH Keywords

stationary distributionMarkov dependencemean search timevariance of the search time

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Searching and sorting (68P10)

Recommendations

• scientific article; zbMATH DE number 970669
• On the move-to-front scheme with Markov dependent requests
• Performance of the move-to-front algorithm with Markov-modulated request sequences
• scientific article; zbMATH DE number 1270016
• Convergence to stationary state for a Markov move-to-front scheme

Cited in

(6)

• Performance of the move-to-front algorithm with Markov-modulated request sequences
• The move-to-root rule for self-organizing trees with Markov dependent requests^∗
• Least-recently-used caching with dependent requests
• Optimality of move-to-front for self-organizing data structures with locality of references
• A fluid limit for a cache algorithm with general request processes
• Convergence to stationary state for a Markov move-to-front scheme

This page was built for publication: The performance of the move-to-front scheme under some particular forms of Markov requests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4866784)