Skip to main content
SpringerLink
Log in

On exponential ergodicity of multiclass queueing networks

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

One of the key performance measures in queueing systems is the decay rate of the steady-state tail probabilities of the queue lengths. It is known that if a corresponding fluid model is stable and the stochastic primitives have finite moments, then the queue lengths also have finite moments, so that the tail probability ℙ(⋅>s) decays faster than s −n for any n. It is natural to conjecture that the decay rate is in fact exponential.

In this paper an example is constructed to demonstrate that this conjecture is false. For a specific stationary policy applied to a network with exponentially distributed interarrival and service times, it is shown that the corresponding fluid limit model is stable, but the tail probability for the buffer length decays slower than s −log s.

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. Dai, J.G.: On the positive Harris recurrence for multiclass queueing networks: A unified approach via fluid models. Ann. Appl. Probab. 5, 49–77 (1995)

    Article  Google Scholar 

  2. Dai, J.G., Meyn, S.P.: Stability and convergence of moments for multiclass queueing networks via fluid limit models. IEEE Trans. Autom. Controls 40, 1889–1904 (1995)

    Google Scholar 

  3. Douc, R., Fort, G., Moulines, E., Soulier, P.: Practical drift conditions for subgeometric rates of convergence. Adv. Appl. Probab. 14(3), 1353–1377 (2004)

    Article  Google Scholar 

  4. Down, D., Meyn, S.P., Tweedie, R.L.: Exponential and uniform ergodicity of Markov processes. Ann. Probab. 23(4), 1671–1691 (1995)

    Article  Google Scholar 

  5. Duffield, N.G., O’Connell, N.: Large deviations and overflow probabilities for the general single-server queue, with applications. Math. Proc. Camb. Philos. Soc. 118(2), 363–374 (1995)

    Article  Google Scholar 

  6. Gamarnik, D., Zeevi, A.: Validity of heavy traffic steady-state approximations in open queueing networks. Ann. Appl. Probab. 16(1), 56–90 (2006)

    Article  Google Scholar 

  7. Ganesh, A., O’Connell, N., Wischik, D.: Big Queues. Lecture Notes in Mathematics, vol. 1838. Springer, Berlin (2004)

    Google Scholar 

  8. Glynn, P.W., Whitt, W.: Logarithmic asymptotics for steady-state tail probabilities in a single-server queue. J. Appl. Probab. 31, 131–156 (1994)

    Article  Google Scholar 

  9. Kumar, P.R., Meyn, S.P.: Duality and linear programs for stability and performance analysis queueing networks and scheduling policies. IEEE Trans. Autom. Control 41(1), 4–17 (1996)

    Article  Google Scholar 

  10. Kumar, P.R., Seidman, T.I.: Dynamic instabilities and stabilization methods in distributed real-time scheduling of manufacturing systems. IEEE Trans. Autom. Control AC-35(3), 289–298 (1990)

    Article  Google Scholar 

  11. Malyshev, V.A., Men’shikov, M.V.: Ergodicity, continuity and analyticity of countable Markov chains. Tr. Mosk. Mat. Obs. 39, 3–48 (1979). Trans. Mosc. Math. Soc. 1, 1–48 (1981)

    Google Scholar 

  12. Meyn, S.P.: Sequencing and routing in multiclass queueing networks. Part I: Feedback regulation. SIAM J. Control Optim. 40(3), 741–776 (2001)

    Article  Google Scholar 

  13. Meyn, S.P.: Workload models for stochastic networks: Value functions and performance evaluation. IEEE Trans. Autom. Control 50(8), 1106–1122 (2005)

    Article  Google Scholar 

  14. Meyn, S.P.: Control Techniques for Complex Networks. Cambridge University Press, Cambridge (2007)

    Google Scholar 

  15. Meyn, S.P., Tweedie, R.L.: Markov Chains and Stochastic Stability, 2nd edn. Cambridge University Press, London (2009). Published in the Cambridge Mathematical Library. 1993 edition online: http://black.csl.uiuc.edu/~meyn/pages/book.html

    Google Scholar 

  16. Resnick, S.: Adventures in Stochastic Processes. Birkhäuser, Boston (1992)

    Google Scholar 

  17. Rybko, A., Stolyar, A.: On the ergodicity of stochastic processes describing open queueing networks. Probl. Pered. Inf. 28, 3–26 (1992)

    Google Scholar 

  18. Shwartz, A., Weiss, A.: Large Deviations for Performance Analysis. Chapman and Hall, London (1995)

    Google Scholar 

  19. Stolyar, A.: On the stability of multiclass queueing networks: A relaxed sufficient condition via limiting fluid processes. Markov Process. Relat. Fields 491–512 (1995)

  20. Tuominen, P., Tweedie, R.L.: Subgeometric rates of convergence of f-ergodic Markov chains. Adv. Appl. Probab. 26, 775–798 (1994)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. MIT Sloan School of Management, Cambridge, MA, 02139, USA

    David Gamarnik

  2. Department of Electrical and Computer Engineering and the Coordinated Sciences Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL, 61801, USA

    Sean Meyn

Authors
  1. David Gamarnik
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sean Meyn
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to David Gamarnik.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gamarnik, D., Meyn, S. On exponential ergodicity of multiclass queueing networks. Queueing Syst 65, 109–133 (2010). https://doi.org/10.1007/s11134-010-9173-2

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11134-010-9173-2

Keywords

Mathematics Subject Classification (2000)

Search

Navigation