Displaying similar documents to “Calculation of steady-state probabilities of M/M queues: Further approaches.”

Standard and retrial queueing systems: a comparative analysis.

Jesús Artalejo, Gennadi Falin (2002)

Revista Matemática Complutense

Similarity:

We describe main models and results of a new branch of the queueing theory, theory of retrial queues, which is characterized by the following basic assumption: a customer who cannot get service (due to finite capacity of the system, balking, impatience, etc.) leaves the service area, but after some random delay returns to the system again. Emphasis is done on comparison with standard queues with waiting line and queues with losses. We give a survey of main results for both single server...

On main characteristics of the M / M / 1 / N queue with single and batch arrivals and the queue size controlled by AQM algorithms

Wojciech M. Kempa (2011)

Kybernetika

Similarity:

In the article finite-buffer queueing systems of the M / M / 1 / N type with queue size controlled by AQM algorithms are considered, separately for single and batch arrivals. In the latter case two different acceptance strategies: WBAS (Whole Batch Acceptance Strategy) and PBAS (Partial Batch Acceptance Strategy) are distinguished. Three essential characteristics of the system are investigated: the stationary queue-size distribution, the number of consecutively dropped packets (batches of packets)...

Analysis of AQM queues with queue size based packet dropping

Andrzej Chydziński, Łukasz Chróst (2011)

International Journal of Applied Mathematics and Computer Science

Similarity:

Queueing systems in which an arriving job is blocked and lost with a probability that depends on the queue size are studied. The study is motivated by the popularity of Active Queue Management (AQM) algorithms proposed for packet queueing in Internet routers. AQM algorithms often exploit the idea of queue-size based packet dropping. The main results include analytical solutions for queue size distribution, loss ratio and throughput. The analytical results are illustrated via numerical...

An M/G/1 queueing system with compulsory server vacations.

Kilash C. Madan (1992)

Trabajos de Investigación Operativa

Similarity:

This paper deals with a single server queue with compulsory server vacations. There are single Poisson arrivals with mean arrival date λ and the service is performed in batches of fixed size M (≥1) or min (n, M) and the service times of successive batches follow a general distribution with the density function D(x). The Laplace transforms of the probability generating functions of different states of the system have been obtained, the corresponding steady state results have been derived...