Abstract
In this paper we study the transient behavior of the MGEL/MGEM/1 queueing system, where MGE is the class of mixed generalized Erlang distributions which can approximate an arbitrary distribution. We use the method of stages combined with the separation of variables and root finding techniques together with linear and tensor algebra. We find simple closed form expressions for the Laplace transforms of the queue length distribution and the waiting time distribution under FCFS when the system is initially empty and the busy period distribution. We report computational results by inverting these expressions numerically in the time domain. Because of the simplicity of the expressions derived our algorithm is very fast and robust.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Abate and W. Whitt, Transient behavior of theM/M/1 queue via Laplace transforms, Adv. Appl. Prob. 20 (1988) 145–178.
D. Bertsimas, An analytic approach to a general class ofG/G/s queueing systems, Oper. Res. 38 (1990) 139–155.
D. Bertsimas, J. Keilson, D. Nakazato and H. Zhang, Transient and busy period analysis of theGI/G/1 queue: solution as a Hilbert problem, to appear in J. Appl. Prob. (1990).
D.R. Cox, A use of complex probabilities in the theory of stochastic processes, Proc. Camb. Phil. Soc. 51 (1955) 313–319.
W.K. Grassmann, Transient solutions in Markovian queueing systems, Comput. Oper. Res. 4 (1977) 47–53.
D. Gross and C. Harris, Fundamentals of Queueing Theory (Wiley, New York, 1985).
T. Hosono, Numerical inversion of Laplace transform and some applications to wave optics, Radio Sci. 16 (1981) 1015–1019.
J. Keilson and M. Zachmann, Homogeneous row-continuous bivariate Markov chains with boundaries, J. Appl. Prob., Suppl. vol. 25A (Celebration of Applied Probability) (1988) 237–256.
L. Kleinrock, Queueing systems, Vol. 1: Theory (Wiley, New York, 1975).
M. Neuts, Matrix-Geometric Solutions in Stochastic Models; an Algorithmic Approach (The Johns Hopkins University Press, Baltimore, 1981).
L. Platzman, J. Ammons and J. Bartholdi, A simple and efficient algorithm to compute tail probabilities from transforms, Oper. Res. 36 (1988) 137–144.
V. Ramaswami, The busy period of queues which have a matrixgeometric steady state probability vector, Opsearch 19 (1982) 238–261.
S. Wolfram,Mathematica; a System of Doing Mathematics by Computer (Addison Wesley, New York, 1988).
Author information
Authors and Affiliations
Additional information
The research of the author was partially supported by grants from the Leaders for Manufacturing program at MIT and from Draper Laboratory.
Rights and permissions
About this article
Cite this article
Bertsimas, D.J., Nakazato, D. Transient and busy period analysis of theGI/G/1 queue: The method of stages. Queueing Syst 10, 153–184 (1992). https://doi.org/10.1007/BF01159205
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01159205