Displaying similar documents to “The M/G/1 retrial queue: an information theoretic approach.”

Entropy maximization and the busy period of some single-server vacation models

Jesus R. Artalejo, Maria J. Lopez-Herrero (2004)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

In this paper, information theoretic methodology for system modeling is applied to investigate the probability density function of the busy period in M / G / 1 vacation models operating under the N -, T - and D -policies. The information about the density function is limited to a few mean value constraints (usually the first moments). By using the maximum entropy methodology one obtains the least biased probability density function satisfying the system’s constraints. The analysis of the three...

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

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