The performance of the move-to-front scheme under some particular forms of Markov requests
From MaRDI portal
Publication:4866784
DOI10.2307/3215222zbMath0839.60067OpenAlexW4254668340MaRDI QIDQ4866784
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
Searching and sorting (68P10) 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)
Related Items
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 ⋮ A fluid limit for a cache algorithm with general request processes