Abstract
This paper presents a unified approach for the numerical solutions of anM/G/1 queue. On the assumption that the service-time distribution has a rational Laplace-Stieltjes transform (LST), explicit closed-form expressions have been obtained for moments, distributions of system length and waiting time (in queue) in terms of the roots of associated characteristic equations (c.e.'s). Approximate analyses for the tails of the distributions based on one or more roots are also discussed. Numerical aspects have been tested for a variety of complex service-time distributions including but not restricted to only mixed generalized Erlang and generalized hyperexponential. A sample of numerical computations is also included. It is hoped that the results obtained would prove to be beneficial to both practitioners and theorists dealing with bounds, inequalities, approximations, and other aspects.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R.F. Botta, C.M. Harris and W.G. Marchal, Characterization of generalized hyperexponential distribution functions, Commun. Statist.-Stochastic Models 3 (1987) 115–148.
G. Brière and M.L. Chaudhry, Computational analysis of single-server bulk-arrival queues: GIX/M/1, Queueing Systems 2 (1987) 173–185.
M.L. Chaudhry,QPACK Software Package (A&A Publ., 395 Carrie Cresc., Kingston, Ontario, Canada K7M 5X7, 1991).
M.L. Chaudhry, C.M. Harris and W.G. Marchal, Robustness of rootfinding in single-server queueing models, ORSA J. Comput. 2 (1990) 273–286.
M.L. Chaudhry and J.G.C. Templeton,A First Course in Bulk Queues (Wiley, New York, 1983).
S.D. Conte and C. de Boor,Elementary Numerical Analysis (McGraw-Hill, New York, 1972).
J.N. Daigle, Queue length distributions from probability generating functions via discrete Fourier transforms, Oper. Res. Lett. 8 (1989) 229–236.
W. Feller,An Introduction to Probability Theory and Its Applications, vol. 1, 3rd ed. (Wiley, New York, 1968).
D. Gross, and C.M. Harris,Fundamentals of Queueing Theory, 2nd ed. (Wiley, New York, 1985).
J.F.C. Kingman, The single server queue in heavy traffic, Proc. Camb. Phil. Soc. 58 (1960) 902–904.
L. Kleinrock,Queueing Systems: Computer Applications, vol. 2 (Wiley, New York, 1976).
H. Kobayashi,Discrete-Time Queueing Systems in Probability Theory and Computer Science, eds. G. Louchard and G. Latouche (Academic Press, New York, 1983).
M.F. Neuts,Matrix-Geometric Solutions in Stochastic Models — An Algorithmic Approach (The Johns Hopkins University Press, Baltimore, 1981).
M.F. Neuts,Structured Stochastic Matrices of M/G/1 Type and Their Applications (McGraw-Hill, New York, 1989).
L.K. Platzman, J.C. Ammons and J.J. Bartholdi III, A simple and efficient algorithm to compute tail probabilities from transforms, Oper. Res. 36 (1988) 137–144.
W.B. Powell, Stochastic delays in transportation terminals: new results in the theory and applications of bulk queues, Ph.D. Dissertation, MIT, Cambridge, MA (1981).
T.L. Saaty,Elements of Queueing Theory with Applications (McGraw-Hill, New York, 1961).
L. Takács,Introduction to the Theory of Queues (Oxford University Press, New York, 1962).
H.C. Tijms,Stochastic Modelling and Analysis — A Computational Approach (Wiley, New York, 1986).
M.H. van Hoorn, Numerical analysis of multi-server queues with deterministic service and phase-type arrivals, Z. Oper. Res. 30A (1986) 15–28.
C.M. Woodside and E.D.S. Ho, Engineering calculations of overflow probabilities in buffers with Markov-interrupted service, IEEE Trans. Commun. COM-35 (1987) 1272–1277.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chaudhry, M.L., Gupta, U.C. & Agarwal, M. Exact and approximate numerical solutions to steady-state single-server queues:M/G/1 — a unified approach. Queueing Syst 10, 351–379 (1992). https://doi.org/10.1007/BF01193326
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01193326