Standard Article

Performance Bounds in Queueing Networks

  1. Michael H. Veatch

Published Online: 15 FEB 2011

DOI: 10.1002/9780470400531.eorms0656

Wiley Encyclopedia of Operations Research and Management Science

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. .

Author Information

  1. Gordon College, Department of Mathematics, Wenham, Massachusetts

Publication History

  1. Published Online: 15 FEB 2011

Abstract

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.

Keywords:

  • Markov decision process;
  • achievable region method;
  • approximate linear programming;
  • queueing network;
  • pathwise bounds