Displaying similar documents to “Approximation of the Steady State System State Distribution of the M/G/1 Retrial Queue With Impatient Customers”

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

The M/G/1 retrial queue: an information theoretic approach.

Jesús R. Artalejo, María Jesús López Herrero (2005)

SORT

Similarity:

In this paper, we give a survey of the use of information theoretic techniques for the estimation of the main performance characteristics of the M/G/1 retrial queue. We focus on the limiting distribution of the system state, the length of a busy period and the waiting time. Numerical examples are given to illustrate the accuracy of the maximum entropy estimations when they are compared versus the classical solutions.

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.