Reordering heuristics for routing in communications networks
From MaRDI portal
Publication:3719596
DOI10.2307/3214122zbMath0591.60088OpenAlexW4251305410MaRDI QIDQ3719596
Publication date: 1986
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/3214122
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Related Items
An exact formula for the move-to-front rule for self-organizing lists, On the optimality of the counter-scheme for dynamic linear lists, Processor Reordering Rules, MOVE-FORWARD RULES AND f-SWAP RULES APPLIED TO A COMMUNICATION PROBLEM
