On the Three Methods for Bounding the Rate of Convergence for some Continuous-time Markov Chains

Abstract

Consideration is given to the three different analytical methods for the computation of upper bounds for the rate of convergence to the limiting regime of one specific class of (in)homogeneous continuoustime Markov chains. This class is particularly suited to describe evolutions of the total number of customers in (in)homogeneous M/M/S queueing systems with possibly state-dependent arrival and service intensities, batch arrivals and services. One of the methods is based on the logarithmic norm of a linear operator function; the other two rely on Lyapunov functions and differential inequalities, respectively. Less restrictive conditions (compared to those known from the literature) under which the methods are applicable, are being formulated. Two numerical examples are given. It is also shown that for homogeneous birth-death Markov processes defined on a finite state space with all transition rates being positive, all methods yield the same sharp upper bound.

Ergodicity and Perturbation Bounds for $M_t/M_t/1$ Queue with Balking, Catastrophes, Server Failures and Repairs

“…Remark. In all our statements, we can replace the condition of monotonicity of the sequence {d k } by condition d = inf k d k > 0, with the corresponding change in the estimates; see, for example, [16].…”

Convergence Bounds for Limited Processor Sharing Queue with Impatience for Analyzing Non-Stationary File Transfer in Wireless Network

“…This article discusses a special, but rather non-standard, heterogeneous birth and death process, for which, in principle, one can apply the methods described, for example, in articles [13,14], but due to the specifics of the model, in order to obtain acceptable estimates, the authors had to "trick". In particular, the rate of convergence in the example under consideration actually turns out to be rather slow, so that the existing (and constructed) limiting regime begins to adequately show the situation at sufficiently large times Usually, uniformization is used as a method for calculating the transition probabilities for Markov chains, as in [15,16].…”