Performance Bounds in Queueing Networks
Published Online: 15 FEB 2011
Copyright © 2010 John Wiley & Sons, Inc. All rights reserved.
Wiley Encyclopedia of Operations Research and Management Science
How to Cite
Veatch, M. H. 2011. Performance Bounds in Queueing Networks. Wiley Encyclopedia of Operations Research and Management Science. .
- Published Online: 15 FEB 2011
Optimal controls for many multiclass queueing networks are complex and intractable to compute. This paper surveys computable performance bounds. The primary focus is sequencing and scheduling control in open networks to minimize the long run average number of customers, or a weighted average over different customer classes. Lower bounds are given for any policy and, in some cases, upper bounds for a class of policies. Closed networks are considered briefly. Many of these bounds require only solving a linear program. Some pathwise bounds are also discussed.
- Markov decision process;
- achievable region method;
- approximate linear programming;
- queueing network;
- pathwise bounds