The Queueing Network Analyzer

@article{Whitt1983TheQN,
  title={The Queueing Network Analyzer},
  author={Ward Whitt},
  journal={The Bell System Technical Journal},
  year={1983},
  volume={62},
  pages={2779-2815}
}
  • W. Whitt
  • Published 1 November 1983
  • Computer Science
  • The Bell System Technical Journal
This paper describes the Queueing Network Analyzer (QNA), a software package developed at Bell Laboratories to calculate approximate congestion measures for a network of queues. The first version of QNA analyzes open networks of multiserver nodes with the first-come, first-served discipline and no capacity constraints. An important feature is that the external arrival processes need not be Poisson and the service-time distributions need not be exponential. Treating other kinds of variability is… 
View on IEEE
columbia.edu
1,032 Citations
Highly Influential Citations
127
Background Citations
214
Methods Citations
328
Results Citations
11

Figures from this paper

1,032 Citations

Citation Type

Citation Type

Performance of the Queueing Network Analyzer
  • W. Whitt
  • Mathematics
    The Bell System Technical Journal
  • 1983
TLDR
The examples here demonstrate the importance of the variability parameters used in QNA to describe non-Poisson arrival processes and nonexponential service-time distributions and show that QNA performs much better than the standard Markovian algorithm, which does not use variability parameters.
A Robust Queueing Network Analyzer Based on Indices of Dispersion
We develop a robust queueing network analyzer algorithm to approximate the steady-state performance of a single-class open queueing network of single-server queues with Markovian routing. The…
A Robust Queueing Network Analyzer Based on Indices of Dispersion
TLDR
A robust queueing network analyzer algorithm to approximate the steady-state performance of a single-class open queueingnetwork of single-server queues with Markovian routing with heavy-traffic limits is developed.
Dependence in packet queues
TLDR
This study indicates that all three kinds of dependence should be considered in the analysis and measurement of packet queues involving variables packet lengths, and indicates how to predict expected packet delays under heavy loads.
The QNET method for two-moment analysis of open queueing networks
TLDR
A cruder approach to two-moment network analysis, called ΠNET, is described and investigated, which is based on a product form approximation, or decomposition approximation, to the stationary distribution of the Brownian system model.
Decomposition of general tandem queueing networks with MMPP input
  • A. Heindl
  • Computer Science
    Perform. Evaluation
  • 2001
A robust queueing network analyzer based on indices of dispersion
TLDR
A robust queueing network analyzer algorithm to approximate the steady-state performance of a single-class open queueingnetwork of single-server queues with Markovian routing with heavy-traffic limits is developed.
Decomposition of General Tandem Queueing Networks with MMPP Input
  • A. Heindl
  • Computer Science
    Computer Performance Evaluation / TOOLS
  • 2000
TLDR
The internal traffic processes are described as semi-Markov processes (SMPs) and Markov modulated Poisson processes (MMPPs) and correlations in the traffic streams, which are known to have a considerable impact on performance, are taken into account to some extent.
Departures from a Queue with Many Busy Servers
  • W. Whitt
  • Mathematics
    Math. Oper. Res.
  • 1984
TLDR
This paper shows that the stationary departure process is approximately Poisson when there are many busy slow servers in a large class of stationary G/GI/s congestion models having s servers, infinite waiting room, the first-come first-served discipline, and mutually independent and identically distributed service times that are independent of a stationary arrival process.
Diffusion Approximations for Time-Dependent Queueing Systems
  • A. Duda
  • Computer Science, Business
    IEEE J. Sel. Areas Commun.
  • 1986
TLDR
A parametric-decomposition method of the time-dependent analysis of queueing networks which makes possible the analysis of various aspects of computer-communication systems, especially the adaptive routings, the strategies of flow and congestion control, the influence of short overload peaks and other time-varying phenomena in such systems.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 66 REFERENCES
Performance of the Queueing Network Analyzer
  • W. Whitt
  • Mathematics
    The Bell System Technical Journal
  • 1983
TLDR
The examples here demonstrate the importance of the variability parameters used in QNA to describe non-Poisson arrival processes and nonexponential service-time distributions and show that QNA performs much better than the standard Markovian algorithm, which does not use variability parameters.
Departures from a Queue with Many Busy Servers
  • W. Whitt
  • Mathematics
    Math. Oper. Res.
  • 1984
TLDR
This paper shows that the stationary departure process is approximately Poisson when there are many busy slow servers in a large class of stationary G/GI/s congestion models having s servers, infinite waiting room, the first-come first-served discipline, and mutually independent and identically distributed service times that are independent of a stationary arrival process.
Approximate Analysis of General Queuing Networks by Decomposition
  • P. Kuehn
  • Mathematics
    IEEE Trans. Commun.
  • 1979
TLDR
An approximate method for the analysis of general queuing networks is proposed, based on the method of decomposition where the total network is broken up into subsystems; e.g., queuing stations of the type GI/G/1 or subnets.
Moment formulae for a class of mixed multi-job-type queueing networks
  • H. Heffes
  • Computer Science
    The Bell System Technical Journal
  • 1982
TLDR
New results are presented which contribute to the foundations of a tool to support performance analysis and modeling activities and obtain a Little's Law type of relation between delay moments and queue size factorial moments.
On approximations for queues, II: Shape constraints
TLDR
The range of possible values can be reduced dramatically by imposing realistic shape constraints on the interarrival-time distribution with given first two moments and found extremal distributions in the presence of shape constraints by restricting attention to discrete distributions with all mass on a fixed finite set of points.
Heavy-Traffic Limits for Queues with Many Exponential Servers
TLDR
Two different kinds of heavy-traffic limit theorems have been proved for s -server queues and the resulting approximation is better than the earlier ones for many-server systems operating at typically encountered loads.
A class of approximations for the waiting time distribution in a GI/G/1 queueing system
  • A. A. Fredericks
  • Computer Science, Mathematics
    The Bell System Technical Journal
  • 1982
TLDR
A class of approximations for the waiting time distribution in single server queueing systems with general independent (renewal) input and general (independent) service time distributions is presented.
On approximations for queues, I: Extremal distributions
  • W. Whitt
  • Mathematics, Computer Science
    AT&T Bell Laboratories Technical Journal
  • 1984
TLDR
This work calculates the set of possible values for the mean queue length in a GI/M/1 queue and shows how it depends on the traffic intensity and the second moment, and uses extremal distributions to compare alternative parameters for approximations.
Some Inequalities in Queuing
TLDR
Bounds are found for various measures of performance in certain classes of the GI//G1 queue in terms of the mean and variance of the interarrival, service, and idle distributions.
A Light-Traffic Theorem for Multi-Server Queues
TLDR
It is shown that as the traffic goes to zero, the probability of delay depends only on the mean of the service-time distributions and that the delay when positive converges in distribution to the minimum of c independent equilibrium-excess service-times is zero.
...
1
2
3
4
5
...