Displaying similar documents to “Generalized Priority Systems. Analytical Results and Numerical Algorithms”

A finite-buffer queue with a single vacation policy: an analytical study with evolutionary positioning

Marcin Woźniak, Wojciech M. Kempa, Marcin Gabryel, Robert K. Nowicki (2014)

International Journal of Applied Mathematics and Computer Science

Similarity:

In this paper, application of an evolutionary strategy to positioning a GI/M/1/N-type finite-buffer queueing system with exhaustive service and a single vacation policy is presented. The examined object is modeled by a conditional joint transform of the first busy period, the first idle time and the number of packets completely served during the first busy period. A mathematical model is defined recursively by means of input distributions. In the paper, an analytical study and numerical...

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

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

Finite buffer GI/Geo/ 1 batch servicing queue with multiple working vacations

P. Vijaya Laxmi, Kanithi Jyothsna (2014)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

This paper analyzes a discrete-time finite buffer renewal input queue with multiple working vacations where services are performed in batches of maximum size “”. The service times both during a regular service period and vacation period and vacation times are geometrically distributed. Employing the supplementary variable and imbedded Markov chain techniques, we derive the steady-state queue length distributions at pre-arrival, arbitrary and outside observer’s observation epochs. Based...

On the M/G/1 retrial queue subjected to breakdowns

Natalia V. Djellab (2002)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

Retrial queueing systems are characterized by the requirement that customers finding the service area busy must join the retrial group and reapply for service at random intervals. This paper deals with the M/G/1 retrial queue subjected to breakdowns. We use its stochastic decomposition property to approximate the model performance in the case of general retrial times.