Abstract
This paper presents a computationally efficient method to find the steady-state distributions of actual queueing times of the first customer, as well as of a randomly selected customer, of an arrival group for the queueing systemGI X/M/1, and hence the queueing-time distribution of a customer for the systemGI/E X /1. The distribution of virtual queueing time is also obtained. Approximate analysis based on one or more roots is also discussed. Though the exact detailed as well as approximate computations for a variety of interarrival-time distributions such as generalized Erlang, mixed generalized Erlang, hyperexponential, generalized hyperexponential, and deterministic have been carried out, only representative results in the form of tables have been appended. The results obtained should prove useful to queueing theorists, practitioners, and others.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Botta RF, Harris CM (1986) Approximation with generalized hyperexponential distributions: weak convergence results. Queueing Systems 2:169–190
Brière G (1988) Computational analysis of single-server bulk queues. Master's Thesis, Royal Military College of Canada, Kingston, Ontario, Canada
Brière G, Chaudhry ML (1987) Computational analysis of single-server bulk arrival queues:GI X/M/1. Queueing Systems 2:173–185
Chaudhry ML (1991) QPACK software package. A&A Publications, Kingston, Ontario, Canada
Chaudhry ML, Harris CM, Marchal WG (1990) Robustness of rootfinding in single-server queueing models. ORSA Jnl. on Computing 2:273–286
Chaudhry ML, Templeton JGC (1983) A first course in bulk queues. John Wiley, New York
Chaudhry ML, Templeton JGC, Medhi J (1991) Computational analysis of multiserver bulk-arrival queues with constant service timeM X/D/c. Opns. Res. 40:229–238
Cohen JW (1982) The single server queue. North-Holland, Amsterdam
Conte SD, de Boor C (1972) Elementary numerical analysis. McGraw-Hill, New York
Feller W (1968) An introduction to probability theory and its applications Vol. 1,3rd ed. John Wiley, New York
Grassmann WK (1990) Computational methods in probability theory, Chapter 5, pp. 199–254, in Stochastic Models (Handbook in Operations Research and Management Sciences, Vol. 2), Heyman DP, Sobel MJ eds., North Holland, Amsterdam
Kingman JFC (1962) On queues with heavy traffic. Jnl. Royal Statistical Society, Series B 24:383–392
Kleinrock L (1975) Queueing systems, Vol. I: Theory. John Wiley, New York
Kleinrock L (1976) Queueing systems, Vol. II: Computer applications. John Wiley, New York
Neuts MF (1981) Matrix-geometric solutions in stochastic models — an algorithmic approach. The Johns Hopkins University Press, Baltimore
Tijms HC (1986) Stochastic modelling and analysis: a computational approach. Wiley, New York
Van Ommeren JCW (1988) Exponential expansion for the tail of the waiting-time probability of the single-server queue with batch arrivals. Adv. Appl. Prob. 20:880–895
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chaudhry, M.L., Agarwal, M. & Templeton, J.G.C. Computing steady-state queueing-time distributions of single-server queues:GI X/M/1. ZOR - Methods and Models of Operations Research 37, 13–29 (1993). https://doi.org/10.1007/BF01415525
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01415525