AbstractFor a simple queue with finite waiting space the difference equations satisfied by the Laplace transforms of the state probabilities at finite time are solved and the state probabilities have been obtained. The method economizes in algebra and the simple closed form of the state probabilities is used to obtain important parameters
The transient solution is obtained analytically using continued fractions for a state-dependent birt...
An one-line queueing system with the limited accumulator and Markovian applications input flow is co...
In this paper we study a queue with Lévy input, without imposing any a priori assumption on the jump...
For a simple queue with finite waiting space the difference equations satisfied by the Laplace trans...
SUMMARY. A simple series form is obtained for the transient state probabilities of a single server M...
AbstractFor a simple queue with finite waiting space the difference equations satisfied by the Lapla...
Abstract: A finite capacity Markovian queueing system with a number of heterogeneous channels depend...
A new approach is given to obtain the transient probabilities of the M/M/1 queueing system. A first ...
An exact analysis of the MMPP/G/1/K queueing model is carried out, yielding the whole buffer occupan...
A single-server queue system with a limited waiting room and recurrent input is investigated. Phase-...
In this thesis, the Erlang queueing model Af/i/l, where customers arrive at random mean rate A and s...
The time tau(n) of first passage from queue length x to queue lengthn > x in a many-server queue wit...
The transient behavior of the finite-buffer queueing model with batch arrivals and generally distrib...
Summary (translated from the Russian): "We consider a single-server queueing system with a finite-ca...
AbstractA Taylor series method for determining the transient probabilities of the classical single s...
The transient solution is obtained analytically using continued fractions for a state-dependent birt...
An one-line queueing system with the limited accumulator and Markovian applications input flow is co...
In this paper we study a queue with Lévy input, without imposing any a priori assumption on the jump...
For a simple queue with finite waiting space the difference equations satisfied by the Laplace trans...
SUMMARY. A simple series form is obtained for the transient state probabilities of a single server M...
AbstractFor a simple queue with finite waiting space the difference equations satisfied by the Lapla...
Abstract: A finite capacity Markovian queueing system with a number of heterogeneous channels depend...
A new approach is given to obtain the transient probabilities of the M/M/1 queueing system. A first ...
An exact analysis of the MMPP/G/1/K queueing model is carried out, yielding the whole buffer occupan...
A single-server queue system with a limited waiting room and recurrent input is investigated. Phase-...
In this thesis, the Erlang queueing model Af/i/l, where customers arrive at random mean rate A and s...
The time tau(n) of first passage from queue length x to queue lengthn > x in a many-server queue wit...
The transient behavior of the finite-buffer queueing model with batch arrivals and generally distrib...
Summary (translated from the Russian): "We consider a single-server queueing system with a finite-ca...
AbstractA Taylor series method for determining the transient probabilities of the classical single s...
The transient solution is obtained analytically using continued fractions for a state-dependent birt...
An one-line queueing system with the limited accumulator and Markovian applications input flow is co...
In this paper we study a queue with Lévy input, without imposing any a priori assumption on the jump...
DOI
Add to ORKG