A single-server queue system with a limited waiting room and recurrent input is investigated. Phase-type service is a Markov process and is defined by the intensity matrices of phase transitions with and without output. A matrix algorithm is designed for computing the stationary distribution of the Markov process that describes the queueing process for an arbitrary instant as well as for the customer arrival times and customer service times. A Laplace-Stieltjes transformation is derived for waiting limes under the FCFS discipline
A single-server finite-capacity queue with a Markov input is studied under the assumption that the m...
We consider a single-server discrete queucing system in which arrivals occur according to a Markovia...
A discrete time queueing model with Markovian arrival process in which jobs require primary and poss...
A single-server queue system with a limited waiting room and recurrent input is investigated. Phase-...
An one-line queueing system with the limited accumulator and recursive demand input flow is studied....
An one-line queueing system with the limited accumulator and recursive demand input flow is studied....
Summary (translated from the Russian): "We consider a queueing system of GI/GI/1/r type with group a...
Consideration is given to the queuing system with one server, finite-length buffer, and Markov flow ...
A queueing system with one server serving two recurrent inputs with phase type distribution function...
A queueing system with one server serving two recurrent inputs with phase type distribution function...
The queueing system GI/GI/1/r with batch arrival, input and service-lime distribution functions of p...
The queueing system GI/GI/1/r with batch arrival, input and service-lime distribution functions of p...
An one-linear queueing system is considered with recurrent input flow, markovian service process and...
An one-linear queueing system is considered with recurrent input flow, markovian service process and...
A single-server finite-capacity queue with a Markov input is studied under the assumption that the m...
A single-server finite-capacity queue with a Markov input is studied under the assumption that the m...
We consider a single-server discrete queucing system in which arrivals occur according to a Markovia...
A discrete time queueing model with Markovian arrival process in which jobs require primary and poss...
A single-server queue system with a limited waiting room and recurrent input is investigated. Phase-...
An one-line queueing system with the limited accumulator and recursive demand input flow is studied....
An one-line queueing system with the limited accumulator and recursive demand input flow is studied....
Summary (translated from the Russian): "We consider a queueing system of GI/GI/1/r type with group a...
Consideration is given to the queuing system with one server, finite-length buffer, and Markov flow ...
A queueing system with one server serving two recurrent inputs with phase type distribution function...
A queueing system with one server serving two recurrent inputs with phase type distribution function...
The queueing system GI/GI/1/r with batch arrival, input and service-lime distribution functions of p...
The queueing system GI/GI/1/r with batch arrival, input and service-lime distribution functions of p...
An one-linear queueing system is considered with recurrent input flow, markovian service process and...
An one-linear queueing system is considered with recurrent input flow, markovian service process and...
A single-server finite-capacity queue with a Markov input is studied under the assumption that the m...
A single-server finite-capacity queue with a Markov input is studied under the assumption that the m...
We consider a single-server discrete queucing system in which arrivals occur according to a Markovia...
A discrete time queueing model with Markovian arrival process in which jobs require primary and poss...