Performance of the Queueing Network Analyzer
- 1 November 1983
- journal article
- website
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Bell System Technical Journal
- Vol. 62 (9) , 2817-2843
- https://doi.org/10.1002/j.1538-7305.1983.tb03205.x
Abstract
This paper describes the performance of the Queueing Network Analyzer (QNA), a software package developed at Bell Laboratories to calculate approximate congestion measures for networks of queues. QNA is compared with simulations and other approximations of several open networks of single-server queues. This paper illustrates how to apply QNA and indicates the quality that can be expected from the approximations. The examples here demonstrate the importance of the variability parameters used in QNA to describe non-Poisson arrival processes and nonexponential service-time distributions. For these examples, QNA performs much better than the standard Markovian algorithm, which does not use variability parameters. The accuracy of the QNA results (e.g., the expected delays) in these examples is satisfactory for engineering purposes.Keywords
This publication has 5 references indexed in Scilit:
- The marshall and stoyan bounds for IMRL/G/1 queues are tightOperations Research Letters, 1982
- Refining diffusion approximations for queuesOperations Research Letters, 1982
- Approximating a Point Process by a Renewal Process, I: Two Basic MethodsOperations Research, 1982
- On Poisson Approximations for Superposition Arrival Processes in QueuesManagement Science, 1982
- Approximate Analysis of General Queuing Networks by DecompositionIEEE Transactions on Communications, 1979