Balanced Job Bound Analysis of Queueing Networks

Abstract

Applications of queueing network models to computer system performance prediction typically involve the computation of exact equilibrium solutions. This procedure can be quite expensive. In actual modeling studies, many alternative systems must be considered and a model of each developed. The expense of computing the exact solutions of these models may not be warranted by the accuracy required at the initial modeling stages. Instead, bounds on performance are often sufficient. We present a new technique for obtaining performance bounds with only a few arithmetic operations (whereas an exact solution of the model requires a number of arithmetic operations proportional to the product of the number of devices and number of customers). These bounds are often tighter than previously known bounds, although they require somewhat more restrictive assumptions to be applicable. © 1982, ACM. All rights reserved.