Skip to main content
Log in

Sufficient Conditions of the Ergodicity of Queueing Systems with Absolute Priority

  • Published:
Moscow University Computational Mathematics and Cybernetics Aims and scope Submit manuscript

Abstract

The familiar results on ergodicity of priority queueing systems were obtained under the assumption that the input streams of requests of all priorities are Poisson. This assumption is weakened by finding the sufficient conditions of ergodicity of queueing systems with two classes of priorities, where the stream of requests of higher priority is hyperexponential, and the one of lower priority is reccurent. Systems with different types of absolute priority are investigated. To obtain the sought ergodicity conditions, relations are determined that link the sequential values of waiting times of each priority.

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. A. A. Borovkov, Ergodicity and Stability of Random Processes (Editorial URSS, Moscow , 1999) [in Russian].

    MATH  Google Scholar 

  2. S. P. Meyn and R. L. Tweedie, Markov Chains and Stochastic Stability (Springer, London, 1993).

    Book  Google Scholar 

  3. B. V. Gnedenko, E. A. Danielyan, B. N. Dimitrov, G. P. Klimov, and V. F. Matveev, Priority Service Systems (Mosk. Gos. Univ., Moscow, 1973) [in Russian].

    Google Scholar 

  4. D. Yue, W. Yue, and G. Zhao, ‘‘Analysis of an M/M/c queueing system with impatient customers and synchronous vacations,’’ J. Appl. Math. 2014, Article ID 893094, 1-11 (2014).

    Google Scholar 

  5. K. Avrachenkov, E. Morozov, and B. Steyaert, ‘‘Sufficient stability conditions for multi-class constant retrial rate systems,’’ Queueing Syst. 82 (1), 149-171 (2016).

    Article  MathSciNet  Google Scholar 

  6. P. A. Ernst, S. Asmussen, and J. J. Hasenbein, ‘‘Stability and busy periods in a multiclass queue with state-dependent arrival rates,’’ Queueing Syst. 90 (4), 207-224 (2018).

    Article  MathSciNet  Google Scholar 

  7. H.-Q. Ye and D. D. Yao, ‘‘Justifying diffusion approximations for multiclass queueing networks under a moment condition,’’ Ann. Appl. Probab. 28 (6), 3652-3697 (2018).

    Article  MathSciNet  Google Scholar 

  8. A. Arapostathis, G. Pang, and N. Sandrić, ‘‘Ergodicity of a Levy-driven SDE arising from multiclass many-server queues,’’ Ann. Appl. Probab. 29 (2), 1070-1126 (2019).

  9. A. V. Mistryukov and V. G. Ushakov, ‘‘Ergodicity conditions for queueing systems with nonpreemptive priority,’’ Vestn. TvGU, Ser. Prikl. Mat. 1, 5-14 (2019).

    Google Scholar 

  10. A. V. Mistryukov and V. G. Ushakov, ‘‘Sufficient ergodicity conditions for priority queues,’’ Inform. Primen. 12 (2), 24-26 (2018).

    Google Scholar 

  11. V. F. Matveev and V. G. Ushakov, Queuing Systems (Mosk. Gos. Univ., Moscow, 1984) [in Russian].

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to A. V. Mistryukov or V. G. Ushakov.

Additional information

Translated by E. Oborin

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mistryukov, A.V., Ushakov, V.G. Sufficient Conditions of the Ergodicity of Queueing Systems with Absolute Priority . MoscowUniv.Comput.Math.Cybern. 44, 37–43 (2020). https://doi.org/10.3103/S0278641920010082

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0278641920010082

Keywords:

Navigation