Nonstationary queues: estimation of the rate of convergence

From MaRDI portal
Publication:596386

DOI10.1023/B:QUES.0000027991.19758.B4zbMATH Open1056.90030arXivmath/0311142OpenAlexW2000771117MaRDI QIDQ596386FDOQ596386

Boris Granovsky, Alexander I. Zejfman

Publication date: 10 August 2004

Published in: Queueing Systems (Search for Journal in Brave)

Abstract: The paper is devoted to the estimation of the rate of of exponential convergence of nonhomogeneous queues exhibiting different types of ergodicity. The main tool of our study is the method, which was proposed by the second author in the late 1980-s and was subsequently extended and developed in different directions in a series of joint papers by the authors of the present paper. The method originated from the idea of Gnedenko and Makarov to employ the logarithmic norm of a matrix to the study of the problem of stability of nonhomogeneous Markov chains. In the present paper, we apply the method to a class of Markov queues with a special form of nonhomogenuity that is common in applications.


Full work available at URL: https://arxiv.org/abs/math/0311142






Cited In (37)


   Recommendations





This page was built for publication: Nonstationary queues: estimation of the rate of convergence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q596386)