Successively Improving Bounds on Performance Measures for Single Class Product Form Queueing Networks
The use of queueing network models to analyze the performance of computer systems is widespread. Typically the analysis requires certain assumptions to be made. Even under such assumptions, the exact analysis of these models for the performance measures could be quite time consuming, especially when various alternate configurations of the system are to be evaluated. In some situations, bounds on the performance may often be adequate. This issue of obtaining reasonable bounds has hence been the subject of some discussion and a number of bounding techniques have been proposed over the past few years. In this paper we present a bounding technique for networks with a single class of customers that appears to be more effective than techniques previously reported.