The Queueing Network Analyzer

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 important. For example, with packet-switched communication networks we need to describe the congestion resulting from bursty traffic and the nearly constant service times of packets. The general approach in QNA is to approximately characterize the arrival processes by two or three parameters and then analyze the individual nodes separately. The first version of QNA uses two parameters to characterize the arrival processes and service times, one to describe the rate and the other to describe the variability. The nodes are then analyzed as standard GI/G/m queues partially characterized by the first two moments of the interarrival-time and service-time distributions. Congestion measures for the network as a whole are obtained by assuming as an approximation that the nodes are stochastically independent given the approximate flow parameters.

[1]  R. R. P. Jackson.  Introduction to Queueing Theory , 1943 .

[2]  R. I. Wilkinson.  Theories for toll traffic engineering in the U. S. A. , 1956 .

[3]  A. M. Lee,et al.  Queueing Processes Associated with Airline Passenger Check-in , 1959 .

[4]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

[5]  K. T. Marshall,et al.  Some Inequalities in Queuing , 1968, Oper. Res..

[6]  D. Iglehart,et al.  Multiple channel queues in heavy traffic. II: sequences, networks, and batches , 1970, Advances in Applied Probability.

[7]  T. Rolski.  Some inequalities for GI/M/n queues , 1972 .

[8]  J. M. Holtzman.  B.S.T.J. brief: The accuracy of the equivalent random method with renewal inputs , 1973 .

[9]  Anatol Kuczura,et al.  The interrupted poisson process as an overflow process , 1973 .

[10]  J. Köllerström.  Heavy traffic theory for queues with several servers. II , 1974, Journal of Applied Probability.

[11]  Hisashi Kobayashi,et al.  Accuracy of the diffusion approximation for some queuing systems , 1974 .

[12]  Wolfgang Kraemer,et al.  Approximate Formulae for the Delay in the Queueing System GI/G/ 1 , 1976 .

[13]  G. J. A. Stern,et al.  Queueing Systems, Volume 2: Computer Applications , 1976 .

[14]  Yukio Takahashi,et al.  A NUMERICAL METHOD FOR THE STEADY-STATE PROBABILITIES OF A G1/G/C QUEUING SYSTEM IN A GENERAL CLASS , 1976 .

[15]  A. E. Eckberg,et al.  Sharp Bounds on Laplace-Stieltjes Transforms, with Applications to Various Queueing Problems , 1977, Math. Oper. Res..

[16]  Mischa K. Schwartz.  Computer Communications Network Design and Analysis , 1977 .

[17]  K. Mani Chandy,et al.  Approximate Methods for Analyzing Queueing Network Models of Computing Systems , 1978, CSUR.

[18]  S. A. Nozaki,et al.  Approximations in finite-capacity multi-server queues by Poisson arrivals , 1978, Journal of Applied Probability.

[19]  Per Hokstad,et al.  Approximations for the M/G/m Queue , 1978, Oper. Res..

[20]  R. Foley,et al.  Note--Some Results on Sojourn Times in Acyclic Jackson Networks , 1979 .

[21]  John H. Rath,et al.  Technical Note - Approximations for Overflows from Queues with a Finite Waiting Room , 1979, Oper. Res..

[22]  P. Kuehn,et al.  Approximate Analysis of General Queuing Networks by Decomposition , 1979, IEEE Trans. Commun..

[23]  P. Moran,et al.  Reversibility and Stochastic Networks , 1980 .

[24]  J. A. Buzacott,et al.  On the approximations to the single server queue , 1980 .

[25]  J. A. Buzacott,et al.  Open queueing network models of dynamic job shops , 1981 .

[26]  Ward Whitt,et al.  Heavy-Traffic Limits for Queues with Many Exponential Servers , 1981, Oper. Res..

[27]  J. Harrison,et al.  ON THE DISTRIBUTION OF MULTIDIMENSIONAL REFLECTED , 1981 .

[28]  Ward Whitt,et al.  Approximating a point process by a renewal process , 1981 .

[29]  A. Federgruen,et al.  Approximations for the steady-state probabilities in the M/G/c queue , 1981, Advances in Applied Probability.

[30]  K. G. Ramakrishnan,et al.  A class of closed Markovian queuing networks: integral representations, asymptotic expansions, and generalizations , 1981 .

[31]  K. G. Ramakrishnan,et al.  A class of closed Markovian queuing networks: integral representations, asymptotic expansions, and generalizations , 1981, The Bell System Technical Journal.

[32]  S. Albin.  On Poisson Approximations for Superposition Arrival Processes in Queues , 1982 .

[33]  A. A. Fredericks.  A class of approximations for the waiting time distribution in a GI/G/1 queueing system , 1982, The Bell System Technical Journal.

[34]  Ward Whitt,et al.  The marshall and stoyan bounds for IMRL/G/1 queues are tight , 1982, Oper. Res. Lett..

[35]  M. Reiman.  The Heavy Traffic Diffusion Approximation for Sojourn Times in Jackson Networks , 1982 .

[36]  Ward Whitt,et al.  Refining diffusion approximations for queues , 1982, Oper. Res. Lett..

[37]  Daniel P. Heyman,et al.  Stochastic models in operations research , 1982 .

[38]  H. Heffes.  Moment formulae for a class of mixed multi-job-type queueing networks , 1982, The Bell System Technical Journal.

[39]  J. McKenna,et al.  Integral representations and asymptotic expansions for closed Markovian queueing networks: Normal usage , 1982, The Bell System Technical Journal.

[40]  K. G. Ramakrishnan,et al.  An overview of PANACEA, a software package for analyzing Markovian queueing networks , 1982, The Bell System Technical Journal.

[41]  Ward Whitt,et al.  Approximating a Point Process by a Renewal Process, I: Two Basic Methods , 1982, Oper. Res..

[42]  J. D. Smit.  The queue GI/M/s with customers of different types or the queue GI/Hm/s , 1983 .

[43]  David Y. Burman,et al.  A Light-Traffic Theorem for Multi-Server Queues , 1983, Math. Oper. Res..

[44]  W. Whitt,et al.  Performance of the Queueing Network Analyzer , 1983, The Bell System Technical Journal.

[45]  W. Whitt.  On approximations for queues, III: Mixtures of exponential distributions , 1984, AT&T Bell Laboratories Technical Journal.

[46]  Ward Whitt,et al.  Minimizing Delays in the GI/G/1 Queue , 1984, Oper. Res..

[47]  W. Whitt,et al.  On approximations for queues, II: Shape constraints , 1984, AT&T Bell Laboratories Technical Journal.

[48]  Ward Whitt,et al.  Departures from a Queue with Many Busy Servers , 1984, Math. Oper. Res..

[49]  W. Whitt.  On approximations for queues, I: Extremal distributions , 1984, AT&T Bell Laboratories Technical Journal.

[50]  W. Whitt.  Approximations for departure processes and queues in series , 1984 .

[51]  W. Whitt.  Queues with superposition arrival processes in heavy traffic , 1985 .