The Influence of Service-Time Variability in a Closed Network of Queues

Abstract This paper describes the effect of service-time variability on the standard performance measures of a closed network of single-server queues with the first-come first-served discipline and one job class. Several service-time variability principles are proposed to serve as rough practical guidelines. The most interesting one states that the mean queue length at a bottleneck queue typically decreases when the variability of the service time at that queue is increased. The principles are supported here by numerical examples and theorems in special cases. The principles are also applied to test approximation procedures.

[1]  D. Cox.  A use of complex probabilities in the theory of stochastic processes , 1955, Mathematical Proceedings of the Cambridge Philosophical Society.

[2]  Stephen S. Lavenberg,et al.  The Steady-State Queueing Time Distribution for the M/G/1 Finite Capacity Queue , 1975 .

[3]  Ronald W Wolff,et al.  The Effect of Service Time Regularity on System Performance. , 1977 .

[4]  W. Whitt.  Comparison conjectures about the M/G/ s queue , 1983 .

[5]  K. Mani Chandy,et al.  Approximate Analysis of General Queuing Networks , 1975, IBM J. Res. Dev..

[6]  S. Ross.  Average delay in queues with non-stationary Poisson arrivals , 1978, Journal of Applied Probability.

[7]  Dietrich Stoyan,et al.  Technical Note - On the Comparison of Waiting Times in GI/G/1 Queues , 1976, Oper. Res..

[8]  M. Reiser,et al.  A Queueing Network Analysis of Computer Communication Networks with Window Flow Control , 1979, IEEE Trans. Commun..

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

[10]  Hisashi Kobayashi,et al.  The Effects of Service Time Distributions on System Performance , 1974, IFIP Congress.

[11]  Isi Mitrani,et al.  The Distribution of Queuing Network States at Input and Output Instants , 1979, JACM.

[12]  Stephen Tolopka,et al.  Solution of General Queueing Networks Using Norton's Theorem , 1979 .

[13]  Shun-Chen Niu,et al.  On the comparison of waiting times in tandem queues , 1981, Journal of Applied Probability.

[14]  Leonard Kleinrock,et al.  Queueing Systems: Volume I-Theory , 1975 .

[15]  W. Whitt,et al.  Open and closed models for networks of queues , 1984, AT&T Bell Laboratories Technical Journal.

[16]  Ward Whitt,et al.  Comparison methods for queues and other stochastic models , 1986 .

[17]  Andre Benjamin Bondi,et al.  INCORPORATING OPEN QUEUEING MODELS INTO CLOSED QUEUEING NETWORK ALGORITHMS , 1984 .

[18]  Alan J. Mayne,et al.  Introduction to Simulation and SLAM , 1979 .

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

[20]  Satish Kumar Tripathi,et al.  On approximate solution techniques for queueing network models of computer systems , 1979 .

[21]  H. Stoyan.  Monotonieeigenschaften der Kundenwartezeiten im Modell GI/G/1 , 1969 .

[22]  Jeffrey P. Buzen,et al.  Computational algorithms for closed queueing networks with exponential servers , 1973, Commun. ACM.

[23]  Raymond A. Marie,et al.  Calculating equilibrium probabilities for λ(n)/Ck/1/N queues , 1980, Performance.

[24]  Annie W. Shum.  Queueing Models for Computer Systems with General Service Time Distributions , 1976, Outstanding Dissertations in the Computer Sciences.

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

[26]  Gianfranco Balbo,et al.  Approximate solutions of queueing network models of computer systems , 1979 .

[27]  W. Whitt,et al.  The Queueing Network Analyzer , 1983, The Bell System Technical Journal.

[28]  Robert B. Cooper,et al.  An Introduction To Queueing Theory , 2016 .

[29]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[30]  W. J. Gordon,et al.  Closed Queuing Systems with Exponential Servers , 1967, Oper. Res..