Skip to main content
SpringerLink
Log in

Exact and approximate numerical solutions of steady-state distributions arising in the queueGI/G/1

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

In this paper we first obtain, in a unified way, closed-form analytic expressions in terms of roots of the so-called characteristic equation (c.e.), and then discuss the exact numerical solutions of steady-state distributions of (i) actual queueing time, (ii) virtual queueing time, (iii) actual idle time, and (iv) interdeparture time for the queueGI/R/1, whereR denotes the class of distributions whose Laplace-Stieltjes transforms (LSTs) are rational functions (ratios of a polynomial of degree at mostn to a polynomial of degreen). For the purpose of numerical discussions of idle- and interdeparture-time distributions, the interarrival-time distribution is also taken to belong to the classR. It is also shown that numerical computations of the idle-time distribution ofR/G/1 queues can be done even ifG is not taken asR. Throughout the discussions it is assumed that the queue discipline is first-come-first-served (FCFS). For the tail of the actual queueing-time distribution ofGI/R/1, approximations in terms of one or more roots of the c.e. are also discussed. If more than one root is used, they are taken in ascending order of magnitude. Numerical aspects have been tested for a variety of complex interarrival- and service-time distributions. The analysis is not restricted to generalized distributions with phases such as Coxian-n (C n ), but also covers nonphase type distributions such as uniform (U) and deterministic (D). Some numerical results are also presented in the form of tables and figures. It is expected that the results obtained from the present study should prove to be useful not only to practitioners, but also to queueing theorists who would like to test the accuracies of inequalities, bounds or approximations.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D. Bertsimas, An exact FCFS waiting time analysis for a general class ofG/G/s queueing systems, Queueing Systems 3 (1988) 305–320.

    Google Scholar 

  2. R.F. Botta, C.M. Harris and W.G. Marchal, Characterizations of generalized hyperexponential distribution functions, Comm. Statist.-Stochastic Models 3 (1987) 115–148.

    Google Scholar 

  3. G. Brière and M.L. Chaudhry, Computational analysis of single-server bulk-arrival queues:Gl x/M/1, Queueing Systems 2 (1987) 173–185.

    Google Scholar 

  4. M.L. Chaudhry,QPACK Software Package (A&A Publications, 395 Carrie Cresc., Kingston, Ontario, K7M 5X7 Canada, 1991).

    Google Scholar 

  5. M.L. Chaudhry, U.C. Gupta and M. Agarwal, Exact and approximate numerical solutions to steady-state single-server queues:M/G/1 — A unified approach, Queueing Systems 10 (1992) 351–380.

    Google Scholar 

  6. 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.

    Google Scholar 

  7. M.L. Chaudhry, B.R. Madill and G. Brière, Computational analysis of steady-state probabilities ofM/G a,b/1 and related non-bulk queues, Queueing Systems 2 (1987) 93–114.

    Google Scholar 

  8. M.L. Chaudhry and J.G.C. Templeton,A First Course in Bulk Queues (Wiley, New York, 1983).

    Google Scholar 

  9. J.W. Cohen,The Single Server Queue, 2nd ed. (North-Holland, Amsterdam, 1982).

    Google Scholar 

  10. S.D. Conte and C. de Boor,Elementary Numerical Analysis (McGraw-Hill, New York, 1972).

    Google Scholar 

  11. D.R. Cox, A use of complex probabilities in the theory of stochastic processes, Proc. Camb. Phil. Soc. 51 (1955) 313–319.

    Google Scholar 

  12. W. Feller,An Introduction to Probability Theory and Its Applications, Vol. 1, 3rd ed. (Wiley, New York, 1968).

    Google Scholar 

  13. W.K. Grassmann, TheGI/PH/1 queue: A method to find the transition matrix, INFOR 20 (1982) 144–156.

    Google Scholar 

  14. W.K. Grassmann, ThePH x/M/c queue, Selecta Statist. Can. 7 (1986) 25–52.

    Google Scholar 

  15. W.K. Grassmann, Computational methods in probability theory, in:Stochastic Models (Handbook in Operations Research and Management Science, vol. 2), eds., D.P. Heyman and M.J. Sobel (North-Holland, Amsterdam, 1990) pp. 199–254.

    Google Scholar 

  16. W.K. Grassmann and J.L. Jain, Numerical solutions of the waiting time distribution and idle time distribution of the arithmeticGI/G/1 queue, Oper. Res. 37 (1989) 141–150.

    Google Scholar 

  17. D. Gross and C.M. Harris,Fundamentals of Queueing Theory, 2nd ed. (Wiley, New York, 1985).

    Google Scholar 

  18. F.S. Hillier and O.S. Yu,Queueing Tables and Graphs (North-Holland, New York, 1981).

    Google Scholar 

  19. D. Jagerman, Approximations for waiting time inGI/G/1 system, Queueing Systems 2 (1987) 351–362.

    Google Scholar 

  20. J.L. Jain and W.K. Grassmann, Numerical solutions for the departure process from theGI/G/1 queue, Comp. Oper. Res. 15 (1988) 293–296.

    Google Scholar 

  21. J.F.C. Kingman, The single server queue in heavy traffic, Proc. Camb. Phil. Soc. 58 (1960) 902–904.

    Google Scholar 

  22. T. Kimura, A two-moment approximation for the mean waiting time inGI/G/s queue, Manag. Sci. 32 (1986) 751–763.

    Google Scholar 

  23. L. Kleinrock,Queueing Systems: Theory, Vol. 1 (Wiley, New York, 1975).

    Google Scholar 

  24. L. Kleinrock,Queueing Systems: Computer Applications, Vol. 2 (Wiley, New York, 1976).

    Google Scholar 

  25. W. Krämer and M. Lagenbach-Belz, Approximate formulae for the delay in the queueing systemGI/G/1, 8th ITC, Melbourne (1976) pp. 235–1–235–8.

  26. D.V. Lindley, The theory of queues with a single server, Proc. Camb. Phil. Soc. 48 (1952) 277–289.

    Google Scholar 

  27. J.R. Litko,GI/G/1 interdeparture time and queue-length distributions via the Laguerre transform, Queueing Systems 4 (1989) 367–382.

    Google Scholar 

  28. D.M. Lucantoni and V. Ramaswami, Efficient algorithms for solving the non-linear matrix equations in the theory of queues, Stochastic Models 1 (1986) 29–51.

    Google Scholar 

  29. R. Marie, Méthodes iteratives de résolution de modèles mathématiques de systèmes informatiques, R.A.I.R.O. Informatique/Computer Sciences 12 (1978) 107–122.

    Google Scholar 

  30. R. Marie, Calculating equilibrium probabilities for λ(n)/Ck/1/N queues,ACM SIGMET-RICS, Conf. on Measurement and Modelling of Computer Systems (1980) pp. 117–125.

  31. M.F. Neuts,Matrix-Geometric Solutions in Stochastic Models — An Algorithmic Approach (The Johns Hopkins University Press, Baltimore, 1981).

    Google Scholar 

  32. T.J. Ott, On the stationary waiting-time distribution in theGI/G/1 queue, I: Transform methods and almost-phase-type distributions, Adv. Appl. Prob. 26 (1987) 240–265.

    Google Scholar 

  33. V. Ramaswami and G. Latouche, An experimental evaluation of the matrix-geometric method for theGI/PH/1 queue, Comm.-Statist. Stochastic Models 5 (1989) 629–667.

    Google Scholar 

  34. Z. Rosberg, Bounds on the expected waiting time inGI/G/1 queue: Upgrading for low traffic intensity, J. Appl. Prob. 24 (1987) 749–757.

    Google Scholar 

  35. L.P. Seelen, H.C. Tijms and M.H. van Hoorn,Tables for Multi-Server Queues (North-Holland, New York, 1985).

    Google Scholar 

  36. J.G. Shanthikumar, Bilateral phase type distributions, Naval Res. Log. Quart. 32 (1985) 119–136.

    Google Scholar 

  37. J.G. Shanthikumar and J.A. Buzacott, On the approximations of the single server queue, Int. J. Prod. Res. 18 (1980) 761–773.

    Google Scholar 

  38. L. Takács, The limiting distribution of the virtual waiting time and the queue size for a single-server queue with recurrent input and general service times, Sankhyā 25A (1963) 91–100.

    Google Scholar 

  39. H.C. Tijms,Stochastic Modelling and Analysis — A Computational Approach (Wiley, New York, 1986).

    Google Scholar 

  40. M.H. van Hoorn, Numerical analysis of multi-server queues with deterministic service and phase-type arrivals, Z. Oper. Res. 30A (1986) 15–28.

    Google Scholar 

  41. M.H. van Hoorn and L.P. Seelen, Approximations for theGI/G/c queue, J. Appl. Prob. 23 (1986) 484–494.

    Google Scholar 

  42. J.C.W. van Ommeren and R.D. Nobel, On the waiting time distribution inGI/G/1 queue with a Coxian-2 service time distribution, Statist. Neerlandica 43 (1989) 85–90.

    Google Scholar 

  43. W. Whitt, An interpolation approximation for the mean workload in aGI/G/1 queue, Oper. Res. 37 (1989) 936–952.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Royal Military College of Canada, K7K 5L0, Kingston, Ontario, Canada

    M. L. Chaudhry

  2. Department of Operational Research, Faculty of Mathematical Sciences, University of Delhi, 110007, Delhi, India

    Manju Agarwal

  3. Department of Industrial Engineering, University of Toronto, M5S 1A4, Toronto, Ontario, Canada

    J. G. C. Templeton

Authors
  1. M. L. Chaudhry
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manju Agarwal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. G. C. Templeton
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chaudhry, M.L., Agarwal, M. & Templeton, J.G.C. Exact and approximate numerical solutions of steady-state distributions arising in the queueGI/G/1. Queueing Syst 10, 105–152 (1992). https://doi.org/10.1007/BF01158522

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01158522

Keywords

Search

Navigation