We study an M|G|1 queue in which both the arrival rate and the service time distribution depend on the state of an underlying finite-state Markov chain. The solution is obtained by a matrix factorization method. This leads to results for waiting times and queue lengths both at arrival epochs and in continuous time. A numerical algorithm for the calculation of several quantities of interest is described and some numerical examples are given
An one-line queueing system with the limited accumulator and Markovian applications input flow is co...
We investigate the transient and stationary queue-length distributions of a class of service systems...
Abstract|The present paper deals with a flrst-come, flrst-served (FCFS) queueing model to analyze th...
We study an M|G|1 queue in which both the arrival rate and the service time distribution depend on t...
We consider a state-dependent Mn/Gn/1 queueing system with both finite and infinite buffer sizes. We...
A single-server finite-capacity queue with a Markov input is studied under the assumption that the m...
A discrete time queueing model with Markovian arrival process in which jobs require primary and poss...
Summary (translated from the Russian): "We consider a single-server queueing system with a finite-ca...
Key words: Markov-modulated queues, waiting time, heavy traffic.Markov-modulated queueing systems ar...
textabstractThis paper studies an infinite-server queue in a Markov environment, that is, an infinit...
The finite capacity queues, GI/PH/1/N and PH/G/1/N, in which customers are served in groups of varyi...
A general model for the single server semi-Markov queue is studied. Its solution is reduced to a mat...
A single-server queue system with a limited waiting room and recurrent input is investigated. Phase-...
AbstractA general model for the single server semi-Markov queue is studied. Its solution is reduced ...
We investigate the transient and stationary queue length distributions of a class of service systems...
An one-line queueing system with the limited accumulator and Markovian applications input flow is co...
We investigate the transient and stationary queue-length distributions of a class of service systems...
Abstract|The present paper deals with a flrst-come, flrst-served (FCFS) queueing model to analyze th...
We study an M|G|1 queue in which both the arrival rate and the service time distribution depend on t...
We consider a state-dependent Mn/Gn/1 queueing system with both finite and infinite buffer sizes. We...
A single-server finite-capacity queue with a Markov input is studied under the assumption that the m...
A discrete time queueing model with Markovian arrival process in which jobs require primary and poss...
Summary (translated from the Russian): "We consider a single-server queueing system with a finite-ca...
Key words: Markov-modulated queues, waiting time, heavy traffic.Markov-modulated queueing systems ar...
textabstractThis paper studies an infinite-server queue in a Markov environment, that is, an infinit...
The finite capacity queues, GI/PH/1/N and PH/G/1/N, in which customers are served in groups of varyi...
A general model for the single server semi-Markov queue is studied. Its solution is reduced to a mat...
A single-server queue system with a limited waiting room and recurrent input is investigated. Phase-...
AbstractA general model for the single server semi-Markov queue is studied. Its solution is reduced ...
We investigate the transient and stationary queue length distributions of a class of service systems...
An one-line queueing system with the limited accumulator and Markovian applications input flow is co...
We investigate the transient and stationary queue-length distributions of a class of service systems...
Abstract|The present paper deals with a flrst-come, flrst-served (FCFS) queueing model to analyze th...