Informatika i Ee Primeneniya [Informatics and its Applications]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Inform. Primen.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Informatika i Ee Primeneniya [Informatics and its Applications], 2022, Volume 16, Issue 3, Pages 75–82
DOI: https://doi.org/10.14357/19922264220310
(Mi ia803)
 

This article is cited in 1 scientific paper (total in 1 paper)

On an approach for estimating the rate of convergence for nonstationary Markov models of queueing systems

I. A. Kovalevab, Y. A. Satina, A. V. Sinitcinac, A. I. Zeifmanadeb

a Department of Applied Mathematics, Vologda State University, 15 Lenin Str., Vologda 160000, Russian Federation
b Moscow Center for Fundamental and Applied Mathematics, M. V. Lomonosov Moscow State University, 1-52 Leninskie Gory, GSP-1, Moscow 119991, Russian Federation
c P. G. Demidov Yaroslavl State University, 14 Sovetskaya Str., Yaroslavl 150003, Russian Federation
d Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
e Vologda Research Center of the Russian Academy of Sciences, 56A Gorky Str., Vologda 160014, Russian Federation
Full-text PDF (293 kB) Citations (1)
References:
Abstract: The transformation of the forward Kolmogorov system is considered which allows one to obtain simple estimates on the rate of convergence for Markov chains with continuous time describing queuing systems. In addition, the concept of the logarithmic norm of the operator function and the associated estimates of the norm of the Cauchy matrix are used. The results obtained make it possible to estimate the rate of convergence for new classes of models in which the matrix is not significantly nonnegative and the use of the logarithmic norm method does not guarantee the possibility of obtaining estimates of the rate of convergence. Previously, a rather laborious more general method of inequalities was used for such situations. A theorem is formulated on obtaining the rate of convergence when the intensities of the matrix change. An estimate was obtained for the process of birth and death with constant intensities. As an example, a special nonstationary model with group service of requirements (service in pairs) is investigated.
Keywords: rate of convergence, ergodicity bounds, logarithmic norm, queuing systems.
Funding agency Grant number
Russian Science Foundation 21-71-30011
Received: 25.06.2022
Document Type: Article
Language: Russian
Citation: I. A. Kovalev, Y. A. Satin, A. V. Sinitcina, A. I. Zeifman, “On an approach for estimating the rate of convergence for nonstationary Markov models of queueing systems”, Inform. Primen., 16:3 (2022), 75–82
Citation in format AMSBIB
\Bibitem{KovSatSin22}
\by I.~A.~Kovalev, Y.~A.~Satin, A.~V.~Sinitcina, A.~I.~Zeifman
\paper On an approach for estimating the~rate of~convergence for~nonstationary Markov models of~queueing systems
\jour Inform. Primen.
\yr 2022
\vol 16
\issue 3
\pages 75--82
\mathnet{http://mi.mathnet.ru/ia803}
\crossref{https://doi.org/10.14357/19922264220310}
Linking options:
  • https://www.mathnet.ru/eng/ia803
  • https://www.mathnet.ru/eng/ia/v16/i3/p75
  • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Информатика и её применения
    Statistics & downloads:
    Abstract page:84
    Full-text PDF :32
    References:10
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024