Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Extreme and high-level sojourns of the single server queue in heavy traffic

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

This study characterizes the behavior of large queue lengths in heavy traffic. We show that the distribution of the maximum queue length in a random time interval for a queueing systems in heavy traffic converges to a novel extreme value distribution. We also study the processes that record the times that the queue length exceeds a high level and the cumulative time the queue is above the level. We show that these processes converge in distribution to compound Poisson processes.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. S.M. Berman, Extreme sojourns for random walks and birth-and-death processes, Comm. Statist. Stochastic Models 2 (1986) 393–408.

    Google Scholar 

  2. S.M. Berman, Sojourn and Extremes of Stochastic Processes (Wadsworth, Belmont, 1992).

  3. P. Billinsely, Convergence of Probability Measures (Wiley, New York, 1968).

    Google Scholar 

  4. K.L. Chung, Markov Chain with Stationary Transition Probabilities (Springer, New York, 1967).

    Google Scholar 

  5. K.L. Chung, A Course in Probability Theory, 2nd ed. (Harcourt, Brace and World, 1974).

    Google Scholar 

  6. J. Galambos, The Asymptotic Theory of Extreme Order Statistics (Wiley, New York, 1978).

    Google Scholar 

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

    Google Scholar 

  8. J.M. Harrison, Brownian Motion and Stochastic Flow System (Wiley, New York, 1985).

    Google Scholar 

  9. J.M. Harrison and R.J. Williams, Brownian models of open queueing networks with homogeneous customer populations, Stochastics 22 (1987) 77–115.

    Google Scholar 

  10. D.P. Heyman and M.J. Sobel, eds., Handbooks on Operation Research and Management Science, Vol. 2 (Elsevier, Amsterdam, 1990).

    Google Scholar 

  11. D.L. Iglehart and W. Whitt, Multiple channel queues in heavy traffic I, Adv. Appl. Probab. 2 (1970) 150–177.

    Article  Google Scholar 

  12. D.L. Iglehart and W. Whitt, Multiple channel queues in heavy traffic II, Adv. Appl. Probab. 2 (1970) 355–369.

    Article  Google Scholar 

  13. S. Karlin and H.M. Taylor, A First Course in Stochastic Processes, 2nd ed. (Academic Press, New York, 1975).

    Google Scholar 

  14. O. Kallenberg, Random Measure, 2nd ed. (Academic Press, New York, 1983).

    Google Scholar 

  15. J.F.C. Kingman, The single server queues in heavy traffic, Proc. Camb. Phil. Soc. 57 (1961) 902–904.

    Google Scholar 

  16. J.F.C. Kingman, One queue in heavy traffic, J. Roy. Statist. Soc. Ser. B 24 (1962) 383–392.

    Google Scholar 

  17. M.R. Leadbetter, G. Lindgren and H. Rootzen, Extremes and Related Properties of Random Sequences and Process (Springer, New York, 1983).

    Google Scholar 

  18. W.P. Peterson, A heavy traffic limit theorem for networks of queues with multiple customer types, Math. Oper. Res. 16 (1991) 90–118.

    Google Scholar 

  19. D. Pollard, Convergence of Stochastic Processes (Springer, New York, 1985).

    Google Scholar 

  20. M.I. Reiman, Open queueing networks in heavy traffic, Math. Oper. Res. 9 (1984) 441–458.

    Article  Google Scholar 

  21. R.F. Serfozo, High-level exceedances of regenerative and semi-stationary processes, J. Appl. Probab. 17 (1980) 423–431.

    Article  Google Scholar 

  22. R.F. Serfozo, Extreme values of birth and death processes and queues, Stoch. Proc. Appl. 27 (1988) 291–306.

    Article  Google Scholar 

  23. R.F. Serfozo, Extreme values of queue length in M/G/1 and G/M/1 systems, Math. Oper. Res. 13 (1988) 349–357.

    Google Scholar 

  24. R.F. Serfozo, W. Szczotka and K. Topolski, Relating the waiting time in a heavy-traffic queueing system to the queue length, Stoch. Proc. Appl. 52 (1994) 119–134.

    Article  Google Scholar 

  25. M.R. Spiegel, Mathematical Handbook of Formulas and Tables (McGraw-Hill, New York, 1968).

    Google Scholar 

  26. W. Whitt, Some useful functions for functional limit theorems, Math. Oper. Res. 5 (1980) 67–85.

    Google Scholar 

  27. R.W. Wolff, Stochastic Modeling and the Theory of Queues (Prentice-Hall, Englewood Cliffs, NJ, 1989).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chang, KH. Extreme and high-level sojourns of the single server queue in heavy traffic. Queueing Systems 27, 17–35 (1997). https://doi.org/10.1023/A:1019197627948

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1019197627948