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

DOI10.1016/S0167-6377(99)00037-1zbMath0934.90009OpenAlexW2141480424WikidataQ127847377 ScholiaQ127847377MaRDI QIDQ1962831

Predrag Jelenković, Edward G. jun. Coffman

Publication date: 29 April 2000

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(99)00037-1

zbMATH Keywords

Markov-modulated processlocality of referenceself-organizing listsinternet modelingHidden Markov-chainsMove-to-front algorithm

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Related Items (2)

Least-recently-used caching with dependent requests ⋮ A fluid limit for a cache algorithm with general request processes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-negative matrices and Markov chains. 2nd ed
• Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities
• Self-organizing files with dependent accesses
• Heuristics That Dynamically Organize Data Structures
• State learning and mixing in entropy of hidden Markov processes and the Gilbert-Elliott channel
• On a model for storage and search
• Convergence to stationary state for a Markov move-to-front scheme
• The performance of the move-to-front scheme under some particular forms of Markov requests
• On Serial Files with Relocatable Records

This page was built for publication: Performance of the move-to-front algorithm with Markov-modulated request sequences