This paper is largely a review. It considers two main methods used to study stability and to
obtain appropriate quantitative estimates of perturbations of (inhomogeneous) Markov …

What determines the average length of a queue, which stretches in front of a service station?
The answer to this question clearly depends on the average rate at which jobs arrive at the …

We investigate a class of exponentially weakly ergodic inhomogeneous birth and death
processes. We consider special transformations of the reduced intensity matrix of the …

We analyze continuous-time Markovian ɛ-SIS epidemics with self-infections on the
complete graph. The majority of the graphs are analytically intractable, but many physical …

Full article: Perturbation Bounds for M t /M t /N Queue with Catastrophes Skip to Main Content
Taylor and Francis Online homepage Taylor and Francis Online homepage Log in | Register …

Consideration is given to 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) …

We consider time-inhomogeneous Markovian queueing models with batch arrivals and
group services. We study the mathematical expectation of the respective queue-length …

In this paper we present a method for the computation of convergence bounds for four
classes of multiserver queueing systems, described by inhomogeneous Markov chains …

In this paper, we display a method for the computation of convergence bounds for a non-
stationary two-processor heterogeneous system with catastrophes, server failures and …

General nonstationary birth–death process with possible catastrophes on finite state space
is studied. The approach for obtaining the bounds on the rates of convergence to the limiting …