Optimal dynamic routing in Markov queueing networks

DOI10.1016/0005-1098(86)90035-XzbMath0585.90034OpenAlexW2013489250MaRDI QIDQ1071639

Keith W. Ross

Publication date: 1986

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0005-1098(86)90035-x

zbMATH Keywords

computer communication networkstraffic controlMarkov queueing networksExistence of optimal dynamic routing policiesfinite buffer capacitylong-run average and infinite-horizon discounted cases

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Deterministic network models in operations research (90B10) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items

An Overview for Markov Decision Processes in Queues and Networks, Controlling load distribution in the queuing systems

Cites Work

• Unnamed Item
• Unnamed Item
• Dynamic programming and stochastic control
• Technical Note—An Equivalence Between Continuous and Discrete Time Markov Decision Processes
• Optimal control of two interacting service stations
• A simple dynamic routing problem
• Optimal control of service in tandem queues
• Applying a New Device in the Optimization of Exponential Queuing Systems