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

The tightness in the ergodic analysis of regenerative queueing processes

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

The tightness of some queueing stochastic processes is proved and its role in an ergodic analysis is considered. It is proved that the residual service time process in an open Jackson-type network is tight. The same problem is solved for a closed network, where the basic discrete time process is embedded at the service completion epochs. An extention of Kiefer and Wolfowitz's “key” lemma to a nonhomogeneous multiserver queue with an arbitrary initial state is obtained. These results are applied to get the ergodic theorems for the basic regenerative network processes.

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. S. Asmussen, Applied Probability and Queues (Wiley, New York, 1987).

    Google Scholar 

  2. K. Athreya and P. Ney, A new approach to the limit theory of recurrent Markov chains, Trans. Amer. Math. Soc. 245 (1978) 493–501.

    Article  Google Scholar 

  3. F. Baccelli and S. Foss, Stability of Jackson-type queueing networks, Queueing Systems 17 (1994) 5–72.

    Article  Google Scholar 

  4. A. Borovkov, Some limit theorems in the queueing theory II, Theory Probab. Appl. 10 (1965) 375–400.

    Article  Google Scholar 

  5. A. Borovkov, Asymptotic Methods in Queueing Theory (Wiley, New York, 1984).

    Google Scholar 

  6. A. Borovkov, Limit theorems for queueing networks I, Theory Probab. Appl. 31 (1986) 474–490.

    Article  Google Scholar 

  7. M. Bramson, Instability of FIFO queueing networks, Ann. Appl. Probab. 4 (1994) 414–431.

    Google Scholar 

  8. M. Bramson, Instability of FIFO queueing networks with quick service times, Ann. Appl. Probab. 4 (1994) 693–718.

    Google Scholar 

  9. C.-S. Chang, J.A. Thomas and S.-H. Kiang, On the stability of open networks: A unified approach by stochastic dominance, Queueing Systems 15 (1994) 239–260.

    Article  Google Scholar 

  10. J. Dai, On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models, Ann. Appl. Probab. 5 (1995) 49–77.

    Google Scholar 

  11. J. Dai and S. Meyn, Stability and convergence of moments for multiclass queueing networks via fluid limit models, IEEE Trans. Automat. Control 83(3) (1995) 1889–1904.

    Article  Google Scholar 

  12. W. Feller, An Introduction to Probability Theory, Vol. 2 (Wiley, New York, 1971).

    Google Scholar 

  13. S. Foss, On some properties of open queueing networks, Problems Inform. Transmission 25 (1989) 90–97.

    Google Scholar 

  14. S. Foss, Ergodicity of queueing networks, Siberian Math. J. 32 (1991) 183–202.

    Google Scholar 

  15. S. Foss and V. Kalashnikov, Regeneration and renovation in queues, Queueing Systems 8 (1991) 211–224.

    Article  Google Scholar 

  16. J. Harrison and V. Nguyen, Brownian models of multiclass queueing networks: Curent status and open problems, Queueing Systems 13 (1993) 5–40.

    Article  Google Scholar 

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

    Article  Google Scholar 

  18. H. Kaspi and A. Mandelbaum, Regenerative closed queueing networks, Stochastic and Stochastics Rep. 39 (1992) 239–258.

    Google Scholar 

  19. J. Kiefer and J. Wolfowitz, On the theory of queues with many servers, Trans. Amer. Math. Soc. 78 (1955) 1–18.

    Article  Google Scholar 

  20. P. Meyn and D. Down, Stability of generalized Jackson networks, Ann. Appl. Probab. 4 (1994) 124–148.

    Google Scholar 

  21. E. Morozov, Conservation of a regenerative stream in an acyclic net, J. Soviet Math. 57 (1991) 3302–3305.

    Article  Google Scholar 

  22. E. Morozov, A comparison theorem for queueing system with non-identical channels, in: Lecture Notes in Mathematics 1546 (Springer, Berlin, 1993) pp. 130–133.

  23. E. Morozov, Regeneration of a closed queueing network, J. Mat. Sci. 69 (1994) 1186–1192.

    Article  Google Scholar 

  24. E. Morozov, Wide sense regenerative processes with applications to multi-channel queues and networks, Acta Appl. Math. 34 (1994) 189–212.

    Article  Google Scholar 

  25. E. Morozov, An extended regenerative structure and queueing network simulation, Sci. Report 1995–08, Department of Mathematics, Chalmers University (1995).

  26. E. Morozov, Stochastic boundness of some queueing processes, Sci. Report R–95–2022, Department of Mathematics and Computer Science, Aalborg University, Denmark (1995).

    Google Scholar 

  27. E. Morozov, The stability of nonhomogeneous queueing system with regenerative input, Preprint R–95–2021, Department of Mathematics and Computer Science, Aalborg University, Aalborg, Denmark (1995), to appear in J. Math. Sci. 40(3) (1997).

    Google Scholar 

  28. E. Morozov and S. Sigovtsev, Weak regenerative simulation of queueing processes, in: Proc. of Internat. Conf. on Distributed Computer Communication Networks, Tel-Aviv, Israel (November 4–8, 1996) Institute for Information Transmission Problems RAS, Moscow (1996) pp. 63–66.

    Google Scholar 

  29. E. Nummelin, Regeneration in tandem queues, Adv. in Appl. Probab. 13 (1981) 221–230.

    Article  Google Scholar 

  30. D.N. Shanbhag, Some extentions of Takacs's limit theorems, J. Appl. Probab. 11 (1974) 752–761.

    Article  Google Scholar 

  31. K. Sigman, Regeneration in tandem queues with multiserver stations, J. Appl. Probab. 25 (1988) 391–403.

    Article  Google Scholar 

  32. K. Sigman, Queues as Harris recurrent Markov chains, Queueing Systems 3 (1988) 179–198.

    Article  Google Scholar 

  33. K. Sigman, Notes on the stability of closed queueing networks, J. Appl. Probab. 26 (1989) 678–682. (Also correction in J. Appl. Probab. 27 (1990) 735.)

    Article  Google Scholar 

  34. K. Sigman, The stability of open queueing networks, Stochastic Process. Appl. 35 (1990) 11–25.

    Article  Google Scholar 

  35. K. Sigman, One-dependent regenerative processes and queues in continuous time, Math. Oper. Res. 15 (1990) 175–189.

    Article  Google Scholar 

  36. G. Shedler, Regeneration and Networks of Queues (Springer, 1987).

  37. G. Shedler, Stochastic Regenerative Simulation (Academic Press, New York, 1993).

    Google Scholar 

  38. W. Smith, Regenerative stochastic processes, Proc. Roy. Soc. A 232 (1955) 6–31.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics and Cybernetics, Petrozavodsk State University, Lenin prospect 33, Petrozavodsk, 185640, Russia

    Evsei Morozov

Authors
  1. Evsei Morozov
    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

Morozov, E. The tightness in the ergodic analysis of regenerative queueing processes. Queueing Systems 27, 179–203 (1997). https://doi.org/10.1023/A:1019114131583

Download citation

  • Issue Date:

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

Search

Navigation