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

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

Displaying similar documents to “An M/G/1 queueing system with compulsory server vacations.”

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

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