On the number of customers served in the M/G/1 retrial queue: first moments and maximum entropy approach

In this paper we present general results on the number of customers, I, served during the busy period in an M/G/1 retrial system. Its analysis in terms of Laplace transforms has been previously discussed in the literature. However, this solution presents important limitations in practice; in particular, the moments of I cannot be obtained by direct differentiation. We propose a direct method of computation for the second moment of I and also for the probability of k, k ≤ 4, customers being served in a busy period. Then, the maximum entropy principle approach is used to estimate the true distribution of I according to the available information.

[1]  Jesús R. Artalejo,et al.  A classified bibliography of research on retrial queues: Progress in 1990–1999 , 1999 .

[2]  Jesús R. Artalejo,et al.  On the orbit characteristics of the M/G/1 retrial queue , 1996 .

[3]  Ward Whitt,et al.  An Introduction to Numerical Transform Inversion and Its Application to Probability Models , 2000 .

[4]  R. Levine,et al.  An Algorithm for Finding the Distribution of Maximal Entropy , 1979 .

[5]  Kyung C. Chae,et al.  Batch arrival queue with N-policy and single vacation , 1995, Comput. Oper. Res..

[6]  Gennadi Falin.  A single-line system with secondary orders , 1979 .

[7]  Jesús R. Artalejo,et al.  Accessible bibliography on retrial queues , 1999 .

[8]  Brian Conolly,et al.  New results in the theory of repeated orders queueing systems , 1979 .

[9]  Demetres D. Kouvatsos,et al.  A maximum entropy analysis of the M/G/1 and G/M/1 queueing systems at equilibrium , 1983, Acta Informatica.

[10]  John E. Shore,et al.  Information theoretic approximations for M/G/1 and G/G/1 queuing systems , 1982, Acta Informatica.

[11]  R. Levine,et al.  An upper bound for the entropy and its applications to the maximal entropy problem , 1978 .

[12]  Wojciech Szpankowski,et al.  The presence of exponentiality in entropy maximized M/GI/1 queues , 1989, Comput. Oper. Res..

[13]  William H. Press,et al.  Numerical recipes in C. The art of scientific computing , 1987 .

[14]  Demetres D. Kouvatsos,et al.  Entropy maximisation and queueing network models , 1994, Ann. Oper. Res..

[15]  Jesús R. Artalejo,et al.  On the busy period of the M/G/1 retrial queue , 2000 .

[16]  Hyo-Seong Lee.  Optimal control of the MX/G/1/K queue with multiple server vacations , 1995, Comput. Oper. Res..

[17]  Demetres D. Kouvatsos,et al.  A maximum entropy priority approximation for a stableG/G/1 queue , 1989, Acta Informatica.

[18]  William H. Press,et al.  Book-Review - Numerical Recipes in Pascal - the Art of Scientific Computing , 1989 .

[19]  Jesús R. Artalejo,et al.  Information theoretic analysis for queueing systems with quasi-random input , 1995 .

[20]  Hiroshi Ohta,et al.  An Analysis of M/M/s Queueing Systems Based on the Maximum Entropy Principle , 1991 .