Abstract. An approximation of Markov type queueing models with fast Markov switches by Markov models with averaged transition rates is studied. First, an averaging principle for two-component Markov process (xn(t), ζn(t)) is proved in the following form: if a component xn(·) has fast switches, then under some asymp-totic mixing conditions the component ζn(·) weakly converges in Skorokhod space to a Markov process with transition rates averaged by some stationary measures constructed by xn(·). The convergence of a stationary distribution of (xn(·), ζn(·)) is studied as well. The approximation of state-dependent queueing systems of the type MM,Q/MM,Q/m/N with fast Markov switches is considered
In this paper we present a method for the computation of convergence bounds for four classes of mult...
Open queueing networks with Markovian arrival processes and phase type service times are considered....
This article studies an infinite-server queue in a semi-Markov environment: the queue’s input rate ...
Cataloged from PDF version of article.A new approach is suggested to study transient and stable regi...
We investigate an M/M/1 queue operating in two switching environments, where the switch is govern...
This article studies an infinite-server queue in a semi-Markov environment: the queue's input rate i...
Green, Kolesar and Svoronos (in press) and Green and Kolesar (in press) use numerical methods to inv...
We study a general $k$ dimensional infinite server queues process with Markov switching, Poisson arr...
We develop accurate approximations for the delay distribution of the MArP/G/1 queue that capture the...
Consideration is given to the two finite capacity time varying Markov queues: the analogue of the we...
Consideration is given to three different analytical methods for the computation of upper bounds for...
In this paper, we deal with a two-queue polling system attended by a single server. The server visit...
Consider a finite state irreducible Markov process with transition graph G and invariant probability...
In this paper we present a method for the computation of convergence bounds for four classes of mult...
Open queueing networks with Markovian arrival processes and phase type service times are considered....
This article studies an infinite-server queue in a semi-Markov environment: the queue’s input rate ...
Cataloged from PDF version of article.A new approach is suggested to study transient and stable regi...
We investigate an M/M/1 queue operating in two switching environments, where the switch is govern...
This article studies an infinite-server queue in a semi-Markov environment: the queue's input rate i...
Green, Kolesar and Svoronos (in press) and Green and Kolesar (in press) use numerical methods to inv...
We study a general $k$ dimensional infinite server queues process with Markov switching, Poisson arr...
We develop accurate approximations for the delay distribution of the MArP/G/1 queue that capture the...
Consideration is given to the two finite capacity time varying Markov queues: the analogue of the we...
Consideration is given to three different analytical methods for the computation of upper bounds for...
In this paper, we deal with a two-queue polling system attended by a single server. The server visit...
Consider a finite state irreducible Markov process with transition graph G and invariant probability...
In this paper we present a method for the computation of convergence bounds for four classes of mult...
Open queueing networks with Markovian arrival processes and phase type service times are considered....
This article studies an infinite-server queue in a semi-Markov environment: the queue’s input rate ...