|
On the bounds of the rate of convergence and stability for some queueing models
A. I. Zeifmanabc, A. V. Korotyshevab, K. M. Kiselevab, V. Yu. Korolevdc, S. Ya. Shorginc a Institute of Socio-Economic Development of Territories, Russian Academy of Sciences, 56A Gorkogo Str., Vologda 160014, Russian Federation
b Vologda State University, 15 Lenin Str., Vologda 160000, Russian Federation
c Institute of Informatics Problems, Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
d Department of Mathematical Statistics, Faculty of Computational Mathematics and Cybernetics, M. V. Lomonosov Moscow State University, 1-52 Leninskiye Gory, GSP-1, Moscow 119991, Russian Federation
Abstract:
A generalization of the famous Erlang loss system has been considered, namely, a class of Markovian queueing systems with possible simultaneous arrivals and group services has been studied. Necessary and sufficient conditions of weak ergodicity have been obtained for the respective queue-length process and explicit bounds on the rate of convergence and stability have been found. The research is based on the general approach developed in the authors' previous studies for nonhomogeneous Markov systems with batch arrival and service requirements. Also, specific models with periodic intensities and different maximum size of number of arrival customers are discussed. The main limiting characteristics of these models have been computed and the effect of the maximum size of the group of arrival customers on the limiting characteristics of the queue has been studied.
Keywords:
nonstationary Markovian queue; Erlang model; batch arrivals and group services; ergodicity; stability; bounds.
Received: 12.08.2014
Citation:
A. I. Zeifman, A. V. Korotysheva, K. M. Kiseleva, V. Yu. Korolev, S. Ya. Shorgin, “On the bounds of the rate of convergence and stability for some queueing models”, Inform. Primen., 8:3 (2014), 19–27
Linking options:
https://www.mathnet.ru/eng/ia323 https://www.mathnet.ru/eng/ia/v8/i3/p19
|
|