The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “The discrete busy period distribution for various single server queues”

On a discrete modified M / G I / c / ∞ queue

Anatolij Dvurečenskij (1987)

Aplikace matematiky

Similarity:

The busy period distribution of a discrete modified queue M / G I / c / ∞ , with finitely or infinitely many severs , and with different distribution functions of customer service times is derived.

Joint distribution of the busy and idle periods of a discrete modified G I / G I / c / ∞ queue

Anatolij Dvurečenskij (1988)

Aplikace matematiky

Similarity:

For a discrete modified G I / G I / c / ∞ queue, 1 ≤ c < ∞ , where the service times of all customers served during any busy period are independent random variables with not necessarily identical distribution functions, the joint distribution of the busy period, the subsequent idle period and the number of customers served during the busy period is derived. The formulae presented are in a convenient form for practical use. The paper is a continuation of [5], where the M / G I / c / ∞ discrete modified queue has been studied. ...

Performance evaluation of an M/G/n -type queue with bounded capacity and packet dropping

Oleg Tikhonenko, Wojciech M. Kempa (2016)

International Journal of Applied Mathematics and Computer Science

Similarity:

A queueing system of the M/G/n-type, n ≥ 1, with a bounded total volume is considered. It is assumed that the volumes of the arriving packets are generally distributed random variables. Moreover, the AQM-type mechanism is used to control the actual buffer state: each of the arriving packets is dropped with a probability depending on its volume and the occupied volume of the system at the pre-arrival epoch. The explicit formulae for the stationary queue-size distribution and the loss...

A discrete-time queueing system with changes in the vacation times

Ivan Atencia (2016)

International Journal of Applied Mathematics and Computer Science

Similarity:

This paper considers a discrete-time queueing system in which an arriving customer can decide to follow a last come first served (LCFS) service discipline or to become a negative customer that eliminates the one at service, if any. After service completion, the server can opt for a vacation time or it can remain on duty. Changes in the vacation times as well as their associated distribution are thoroughly studied. An extensive analysis of the system is carried out and, using a probability...

Analyzing discrete-time bulk-service queue

Veena Goswami, Umesh C. Gupta, Sujit K. Samanta (2006)

RAIRO - Operations Research

Similarity:

This paper analyzes a discrete-time multi-server queue in which service capacity of each server is a minimum of one and a maximum of customers. The interarrival- and service-times are assumed to be independent and geometrically distributed. The queue is analyzed under the assumptions of early arrival system and late arrival system with delayed access. Besides, obtaining state probabilities at arbitrary and outside observer's observation epochs, some performance measures and waiting-time...