Displaying similar documents to “On the M/G/1 retrial queue subjected to breakdowns”

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...

Restricted admissibility of batches into an M / G /1 type bulk queue with modified Bernoulli schedule server vacations

Kailash C. Madan, Walid Abu-Dayyeh (2002)

ESAIM: Probability and Statistics

Similarity:

We investigate the steady state behavior of an M / G /1 queue with modified Bernoulli schedule server vacations. Batches of variable size arrive at the system according to a compound Poisson process. However, all arriving batches are not allowed into the system. The restriction policy differs when the server is available in the system and when he is on vacation. We obtain in closed form, the steady state probability generating functions for the number of customers in the queue for various...

Analysis of an MAP/PH/1 queue with flexible group service

Arianna Brugno, Ciro D'Apice, Alexander Dudin, Rosanna Manzo (2017)

International Journal of Applied Mathematics and Computer Science

Similarity:

A novel customer batch service discipline for a single server queue is introduced and analyzed. Service to customers is offered in batches of a certain size. If the number of customers in the system at the service completion moment is less than this size, the server does not start the next service until the number of customers in the system reaches this size or a random limitation of the idle time of the server expires, whichever occurs first. Customers arrive according to a Markovian...