Queueing Systems

, Volume 6, Issue 1, pp 261–275 | Cite as

On inference concerning time-dependent queue performance: The M/G/1 example

  • D. P. Gaver
  • P. A. Jacobs
Invited Paper


This paper proposes easily-computed approximations to the finite-time expected waiting time for anM/G/1 system starting from an empty state. Both unsaturated (ρ<1) and saturated (ρ>1) conditions are considered. Numerical evidence is presented to indicate that the quality of the approximations is usefully good, especially when ease of computation is an issue. Further, the methodology is adapted to assess expected waiting time when inference must be made from a random sample of service times, and the decision is made to do so nonparametrically, i.e., without fitting a specific function. The results appear reasonable and potentially useful, and are not burdensome to obtain. The methodology investigated can also be applied to the variety of queueing models that are close siblings ofM/G/1: priority and breakdowns and “vacations” being examples. Of course other approximating and inferential options remain to be investigated.


M/G/1 queue time-dependent behavior approximations exponential approach to equilibrium numerical inversion of Laplace transforms 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    J. Abate and W. Whitt, Transient behavior of theM/M/1 queue via Laplace transforms, Adv. Appl. Prob. 20 (1988) 145–178.CrossRefGoogle Scholar
  2. [2]
    J. Abate and W. Whitt, Approximation for theM/M/1 busy-period distribution, unpublished paper (1987).Google Scholar
  3. [3]
    S. Asmussen and H. Thorisson, Large deviation results for time-dependent queue length distributions, Commun. Statist.-Stochastic Models 4 (1988) 99–116.Google Scholar
  4. [4]
    I.V. Basawa and N.U. Prabhu, Estimation in single server queues, Naval Res. Logist. Quart. 28 (1981) 475–487.Google Scholar
  5. [5]
    I.V. Basawa and N.U. Prabhu, Large sample inference from single server queues, Queueing Systems 3 (1988) 289–304.CrossRefGoogle Scholar
  6. [6]
    U.N. Bhat and S.S. Rao, Statistical analysis of queueing systems, Queueing Systems 1 (1987) 217–247.CrossRefGoogle Scholar
  7. [7]
    A.B. Clarke, A waiting line process of Markov type, Ann. Math. Stat. 27 (1957) 452–459.Google Scholar
  8. [8]
    D.R. Cox, Some problems of statistical analysis connected with congestion, in:Proc. Symp. on Congestion Theory, eds. W.L. Smith and W.E. Wilkinson, Chapel Hill (1964) chap. 10.Google Scholar
  9. [9]
    D.R. Cox, The role of significance tests, Scand. J. Statistics 4 (1977) 49–70.Google Scholar
  10. [10]
    B. Efron, Bootstrap methods: another look at the jackknife, Ann. Statistics 7 (1979) 1–26.Google Scholar
  11. [11]
    B. Efron and R. Tibshirani, Bootstrap methods for standard errors, confidence intervals, and other measures of statistical accuracy, Statist. Sci. 1 (1986) 54–77.Google Scholar
  12. [12]
    W. Feller,An Introduction to Probability Theory and its Applications, vol. 2 (Wiley, New York, 1966).Google Scholar
  13. [13]
    D.P. Gaver and P.A. Jacobs, On inference and transient response forM/G/1 models,Teletraffic Analysis and Computer Performance Evaluation, eds. O.J. Boxma, J.W. Cohen and H.C. Tijms (Elsevier Science/North-Holland, 1986).Google Scholar
  14. [14]
    D.P. Gaver and P.A. Jacobs, System availability: time dependence and statistical inference by (semi) non-parametric methods, Naval Postgraduate School Technical Report (1988), to appear in Applied Stochastic Models and Data Analysis.Google Scholar
  15. [15]
    D.P. Gaver, Observing stochastic processes and approximate transform inversion, Oper. Res. 15 (1966) 444–459.Google Scholar
  16. [16]
    D. Gross and C.M. Harris,Fundamentals of Queueing Theory (Wiley, New York, 1974).Google Scholar
  17. [17]
    J. Keilson,Markov Chain Models — Rarity and Exponentiality (Springer, New York, 1979).Google Scholar
  18. [18]
    P.A.W. Lewis and L. Uribe, The new Naval Postgraduate School random number package — LLRANDOMII, Naval Postgraduate School Technical Report NPS55-81-005, Monterey (1981).Google Scholar
  19. [19]
    M.F. McGrath, D. Gross and N.D. Singpurwalla, A subjective approach to the theory of queues I-modeling, Queueing Systems 1 (1987) 317–333.CrossRefGoogle Scholar
  20. [20]
    M.F. McGrath and N.D. Singpurwalla, A subjective approach to the theory of queues II-inference and information inM/M/1 queues, Queueing Systems 1 (1987) 335–353.CrossRefGoogle Scholar
  21. [21]
    M.R. Middleton, Transient effects inM/G/1 queues: an empirical investigation, Technical Report No. 85, Department of Operations Research, Stanford University, Stanford, CA (1979).Google Scholar
  22. [22]
    G.F. Newell,Applications of Queueing Theory, 2nd ed. (Chapman and Hall, London, 1982).Google Scholar
  23. [23]
    A.R. Odoni and E. Roth, An empirical investigation of the transient behavior of stationary queueing systems, Oper. Res. 31 (1983) 432–455.CrossRefGoogle Scholar
  24. [24]
    L. Schruben and R. Kulkarni, Some consequences of estimating parameters for theM/M/1 queue, Oper. Res. Lett. 1 (1982) 75–78.CrossRefGoogle Scholar
  25. [25]
    H. Stehfest, Algorithm 368, Numerical inversion of Laplace transforms, Comm. Assoc. Comput. Mach. 13 (1970) 47–49 [erratum 13 (1970) 624].Google Scholar
  26. [26]
    L. Takacs,Introduction to the Theory of Queues (Oxford University Press, New York, 1962).Google Scholar
  27. [27]
    J.F. Teugels, The average waiting time as a measure of performance, Queueing Systems 6 (1990) 327–334.Google Scholar

Copyright information

© J.C. Baltzer A.G. Scientific Publishing Company 1990

Authors and Affiliations

  • D. P. Gaver
    • 1
  • P. A. Jacobs
    • 1
  1. 1.Department of Operations ResearchNaval Postgraduate SchoolMontereyUSA

Personalised recommendations