On an estimate of the rate of convergence for regenerative processes in queuing theory and related problems
Galina Zverkina, Mais Farkhadov

TL;DR
This paper discusses how to estimate the convergence rate of regenerative Markov processes in queuing and reliability systems using the adjunction method, providing strict upper bounds for their stationary distribution convergence.
Contribution
It demonstrates the application of the adjunction method to derive strict upper bounds for the convergence rate of ergodic Markov processes in queuing and reliability models.
Findings
The adjunction method effectively bounds the convergence rate.
Applicable to queuing systems, networks, and reliability models.
Provides a practical approach for analyzing system stability.
Abstract
In queuing theory and related problems, it is very important to know the numerical characteristics of an investigated system - both in stationary and non-stationary modes. In some cases, such characteristics can be calculated, but this is possible for a limited number of real models. However, in most cases, it is possible to calculate or estimate the stationary values of the characteristics of the studied models. We can use linear Markov processes to model how the overwhelming majority of queuing systems (QS), reliability systems, and queuing networks (QNS) operate; the processes are regenerative in many cases. In the case when the regeneration period of the Markov process has a finite average value, this process is ergodic. An adjunction method can be used to obtain strict upper bounds for the convergence rate of the Markov process (MP) distribution to a stationary distribution…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Data Processing Techniques · Urban Transport Systems Analysis
