Skip to main content
Log in

Tail asymptotics for M/G/1 type queueing processes with subexponential increments

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

Bivariate regenerative Markov modulated queueing processes {I n ,L n } are described. {I n } is the phase process, and {L n } is the level process. Increments in the level process have subexponential distributions. A general boundary behavior at the level 0 is allowed. The asymptotic tail of the cycle maximum, \(M_{C^{{reg}} } \), during a regenerative cycle, \(C^{{reg}} \), and the asymptotic tail of the stationary random variable L , respectively, of the level process are given and shown to be subexponential with L having the heavier tail.

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. J. Abate, G.L. Choudhury and W. Whitt, Asymptotics for steady-state tail probabilities in structured Markov queueing models, Stochastic Models 10 (1994) 99–143.

    Google Scholar 

  2. J. Abate, G.L. Choudhury and W. Whitt, Exponential approximations for tail probabilities of queues, I: waiting times, Oper. Res. 43 (1995) 885–901.

    Google Scholar 

  3. S. Asmussen, Equilibrium properties of the M/G/1 queue, Z. Wahrscheinlichkeitsth. Verw. Geb. 58 (1981) 267–281.

    Article  Google Scholar 

  4. S. Asmussen, Applied Probability and Queues (Wiley, New York, 1987).

    Google Scholar 

  5. S. Asmussen, Extreme value theory for queues via cycle maxima, Extremes 1(2) (1998) 137–168.

    Article  Google Scholar 

  6. S. Asmussen, Subexponential asymptotics for stochastic processes: extremal behaviour, stationary distributions and first passage probabilities, Ann. Appl. Probab. 8 (1998) 354–374.

    Article  Google Scholar 

  7. S. Asmussen, Ruin Probabilities (World Scientific, Singapore, 1998).

    Google Scholar 

  8. S. Asmussen, K. Binswanger and B. Højgaard, Rare events simulation for heavy tailed distributions, Bernoulli (to appear).

  9. S. Asmussen, C. Kl¨ uppelberg and K. Sigman, Sampling at subexponential times, with queueing applications, Stochastic Process. Appl. 79 (1999) 265–286.

    Article  Google Scholar 

  10. S. Asmussen and D. Perry, On cycle maxima, first passage problems and extreme value theory for queues, Stochastic Models 8 (1992) 421–458.

    Google Scholar 

  11. S. Asmussen, H. Schmidli and V. Schmidt, Tail probabilities for non-standard risk and queueing processes with subexponential jumps, Adv. Appl. Probab. (1996).

  12. S. Asmussen and H. Thorisson, Large deviation results for time-dependent queue length probabili-ties, Stochastic Models 4 (1988) 99–116.

    Google Scholar 

  13. O.J. Boxma, Fluid queues and regular variation, Performance Evaluation 27/28 (1996) 699–712.

    Google Scholar 

  14. O.J. Boxma, Regular variation in a multi-source fluid queue, Research Report, CWI Amsterdam (1996).

  15. G.L. Choudhury and W. Whitt, Long-tail buffer-content distributions in broadband networks, Per-formance Evaluation (1996).

  16. G.E. Denzel and G.L. O'Brien, Limit theorems for extreme values of chain-dependent processes, Ann. Probab. 3 (1975) 773–779.

    Google Scholar 

  17. P. Embrechts, C. Kl ¨ uppelberg and T. Mikosch, Modelling Extremal Events for Insurance and Finance (Springer, Berlin, 1997).

    Google Scholar 

  18. P. Embrechts and N. Veraverbeke, Estimates for the probability of ruin with special emphasis on the possibility of large claims, Insurance: Mathematics and Economics 1 (1982) 55–72.

    Article  Google Scholar 

  19. W. Feller, An Introduction to Probability Theory and Its Applications, Vol. 2 (Wiley, New York, 2nd edition, 1971).

    Google Scholar 

  20. D.P. Gaver Jr, Imbedded Markov chain analysis of a waiting line process in continuous time, Ann. Math. Statist. 30 (1959) 698–720.

    Google Scholar 

  21. P. Glasserman and S.-G. Kou, Limits of first passage times to rare sets in regenerative processes, Ann. Appl. Probab. 5 (1995) 424–445.

    Google Scholar 

  22. P.W. Glynn and W. Whitt, Logarithmic asymptotics for steady-state tail probabilities in a single server queue, Adv. Appl. Probab., Takacs issue (1994) 131–156.

  23. B.V. Gnedenko and I.N. Kovalenko, Introduction to Queueing Theory (Birkh¨ auser, Basel, 1989).

    Google Scholar 

  24. A. Gut, Stopped Random Walks (Springer, Berlin, 1988).

    Google Scholar 

  25. D. Heath, S. Resnick and G. Samorodnitsky, Patterns of buffer overflow in a class of queues with long memory in the input stream, Ann. Appl. Probab. 7 (1997) 1021–1057.

    Article  Google Scholar 

  26. D. Heath, S. Resnick and G. Samorodnitsky, Heavy tails and long range dependence in on/off processes and associated fluid models, Math. Oper. Res. 23 (1998) 145–165.

    Article  Google Scholar 

  27. B. Højgaard and J.R. Møller, Convergence rates in matrix analytic models, Stochastic Models 12 (1996) 265–284.

    Google Scholar 

  28. D.L. Iglehart, Extreme values in the GI/G/1 queue, Ann. Math. Statist. 43 (1972) 627–635.

    Google Scholar 

  29. P.R. Jelenkovic and A.A. Lazar, Subexponential asymptotics of a network multiplexer, Research Report, Centre for Telecommunications Research, Columbia University, New York (1995).

    Google Scholar 

  30. P.R. Jelenkovic and A.A. Lazar, Multiplexing on-off sources with subexponential on periods, Re-search Report, Centre for Telecommunications Research, Columbia University, New York (1996).

    Google Scholar 

  31. P.R. Jelenkovic and A.A. Lazar, Subexponential asymptotics of a Markov-modulated random walk with queueing applications, J. Appl. Probab. 35 (1998) 325–347.

    Article  Google Scholar 

  32. J. Keilson, A limit theorem for passage times in ergodic regenerative processes, Ann. Math. Statist. 37 (1966) 866–870.

    Google Scholar 

  33. J. Keilson, Markov Chain Models-Rarity and Exponentiality (Springer, Berlin, 1979).

    Google Scholar 

  34. P. Le Gall, Les Systemes avec ou sans Attente et les Processus Stochastiques (Dunod, Paris, 1962).

    Google Scholar 

  35. M.F. Neuts, The caudal characteristic curve of queues, Adv. Appl. Probab. 18 (1986) 221–254.

    Article  Google Scholar 

  36. M.F. Neuts, Structured Stochastic Matrices of M/G/1 Type and Their Applications (Marcel Dekker, New York, 1989).

    Google Scholar 

  37. M.F. Neuts, Matrix-Geometric Solutions in Stochastic Models, An Algorithmic Approach (Dover, 1994).

  38. M.F. Neuts, Matrix-analytic methods in queueing theory, in: Advances in Queueing, Theory, Meth-ods and Open Problems, ed. J.H. Dshalalow (CRC Press, Boka Raton, FL, 1995) pp. 265–292.

    Google Scholar 

  39. V. Ramaswami, Matrix analytic methods: A tutorial overview with some extensions and new results, in: Matrix-Analytic Methods in Stochastic Models, Vol. 183, eds. S.R. Chakravarthy and A.S. Alfa (Marcel Dekker, New York, 1997) pp. 261–296.

    Google Scholar 

  40. S.I. Resnick, Tail equivalence and its applications, J. Appl. Probab. 8 (1971) 135–156.

    Google Scholar 

  41. S.I. Resnick, Heavy tail modeling and teletraffic data, Ann. Statist. 25 (1997) 1805–1869.

    Article  Google Scholar 

  42. S.I. Resnick and M.F. Neuts, Limit laws for maxima of a sequence of random variables defined on a Markov chain, Adv. Appl. Probab. 2 (1970) 323–343.

    Article  Google Scholar 

  43. T. Rolski, S. Schlegel and V. Schmidt, Asymptotics of Palm-stationary buffer content distributions in fluid flow queues, Adv. Appl. Probab. 31 (1999) 235–253.

    Article  Google Scholar 

  44. K. Sigman, Appendix: A primer on heavy-tailed distributions, Queueing Systems (this issue) 33 (1999) 261–275.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Asmussen, S., Møller, J.R. Tail asymptotics for M/G/1 type queueing processes with subexponential increments. Queueing Systems 33, 153–176 (1999). https://doi.org/10.1023/A:1019172028316

Download citation

  • Issue Date:

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

Navigation