RUS  ENG
Full version
JOURNALS // Informatika i Ee Primeneniya [Informatics and its Applications] // Archive

Inform. Primen., 2020 Volume 14, Issue 2, Pages 3–9 (Mi ia655)

On approaches to constructing limiting regimes for some queuing models

Ya. A. Satina, A. I. Zeifmanabc, G. N. Shilovaa

a Vologda State University, 15 Lenin Str., Vologda 160000, Russian Federation
b Institute of Informatics Problems, Federal Research Center “Computer Sciences and Control” of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119133, Russian Federation
c Vologda Research Center of the Russian Academy of Sciences, 56A Gorky Str., Vologda 160014, Russian Federation

Abstract: The authors consider nonstationary queuing models, the number of customers in which is described by finite Markov chains with periodic intensities. For many classes of such models, the methods of obtaining upper bounds on the rate of convergence to the limiting regime were developed in previous papers of the authors. Using these methods, one can find the main limiting characteristics of the system, study their stability with respect to small perturbations of the arrival and service intensities, and receive information on how current characteristics of the system differ from the limiting characteristics at each moment of time. In the present paper, the authors study a different situation, namely, it is assumed that explicit estimates of the rate of convergence to the limiting regime cannot be obtained. The methods for constructing the limiting regimes of such systems and for obtaining information on the rate of convergence to them are considered. As an example, the authors consider a simple model of a nonstationary system with a rather slow rate of convergence to the limiting regime.

Keywords: queuing system, finite Markov chains, periodic intensities, limiting characteristics, rate of convergence.

Received: 16.03.2020

DOI: 10.14357/19922264200201



© Steklov Math. Inst. of RAS, 2024