The presence of exponentiality in entropy maximized M/Gl/1 queues
Computers and Operations Research
A maximum entropy priority approximation for a stable G/G/1 Queue
Acta Informatica
Numerical recipes in FORTRAN (2nd ed.): the art of scientific computing
Numerical recipes in FORTRAN (2nd ed.): the art of scientific computing
Information theoretic approximations for the M/G/1 retrial queue
Acta Informatica
Batch arrival queue with N-policy and single vacation
Computers and Operations Research
Optimal control of the MX/G/1/K queue with multiple server vacations
Computers and Operations Research
Accessible bibliography on retrial queues
Mathematical and Computer Modelling: An International Journal
Information theoretic analysis for queueing systems with quasi-random input
Mathematical and Computer Modelling: An International Journal
Modified vacation policy for M/G/1 retrial queue with balking and feedback
Computers and Industrial Engineering
On a batch retrial model with J vacations
Journal of Computational and Applied Mathematics
Analysis of the successful and blocked events in the Geo/Geo/c retrial queue
Computers & Mathematics with Applications
| Hi-index | 0.01 |
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.