36 research outputs found
Error bounds for last-column-block-augmented truncations of block-structured Markov chains
This paper discusses the error estimation of the last-column-block-augmented
northwest-corner truncation (LC-block-augmented truncation, for short) of
block-structured Markov chains (BSMCs) in continuous time. We first derive
upper bounds for the absolute difference between the time-averaged functionals
of a BSMC and its LC-block-augmented truncation, under the assumption that the
BSMC satisfies the general -modulated drift condition. We then establish
computable bounds for a special case where the BSMC is exponentially ergodic.
To derive such computable bounds for the general case, we propose a method that
reduces BSMCs to be exponentially ergodic. We also apply the obtained bounds to
level-dependent quasi-birth-and-death processes (LD-QBDs), and discuss the
properties of the bounds through the numerical results on an M/M/ retrial
queue, which is a representative example of LD-QBDs. Finally, we present
computable perturbation bounds for the stationary distribution vectors of
BSMCs.Comment: This version has fixed the bugs for the positions of Figures 1
through
On the Three Methods for Bounding the Rate of Convergence for some Continuous-time Markov Chains
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 continuous-time Markov chains. This
class is particularly suited to describe evolutions of the total number of
customers in (in)homogeneous 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
Two approaches to the construction of perturbation bounds for continuous-time Markov chains
The paper is largely of a review nature. It considers two main methods used
to study stability and obtain appropriate quantitative estimates of
perturbations of (inhomogeneous) Markov chains with continuous time and a
finite or countable state space. An approach is described to the construction
of perturbation estimates for the main five classes of such chains associated
with queuing models. Several specific models are considered for which the limit
characteristics and perturbation bounds for admissible "perturbed" processes
are calculated