The M/G/1 retrial queue: An information theoretic approach

• Autores: Jesús Manuel Artalejo Rodríguez, María Jesús López Herrero
• Localización: Sort: Statistics and Operations Research Transactions, ISSN 1696-2281, Vol. 29, Nº. 1, 2005, págs. 119-137
• Idioma: inglés
• Títulos paralelos:
  • La cola con reintentos M/G/1: un enfoque basado en la teoría de la información
• Enlaces
  • Texto completo (pdf)
• Resumen

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

• Referencias bibliográficas
  • Agmon, N., Alhassid, Y. and Levine, R.D. (1979). An algorithm for finding the distribution of maximal entropy. Journal of Computational Physics,...
  • Aissani, A. and Smail, R. (2003). Information theoretic approximations for the M/G/1 retrial queue with unreliable server (preprint).
  • Artalejo, J.R. (1999a). Accessible bibliography on retrial queues. Mathematical and Computer Modelling, 30, 1-6.
  • Artalejo, J.R. (1999b). A classified bibliography of research on retrial queues: Progress in 1990-1999. Top, 7, 187-211.
  • Artalejo, J.R. and Gomez-Corral, A. (1995). Information theoretic analysis for queueing systems with quasi-random input. Mathematical and...
  • Artalejo, J.R. and Lopez-Herrero, M.J. (2000). On the busy period of the M/G/1 retrial queue. Naval Research Logistics, 47, 115-127.
  • Artalejo, J.R., Falin, G.I. and Lopez-Herrero, M.J. (2002). A second order analysis of the waiting time in the M/G/1 retrial queue. Asia-Pacific...
  • Artalejo, J.R. and Martin, M. (1994). A maximum entropy analysis of the M/G/1 queue with constant repeated attempts. In Selected Topics on...
  • Falin, G.I., Martin, M. and Artalejo, J.R. (1994). Information theoretic approximations for the M/G/1 retrial queue. Acta Informatica, 31,...
  • Falin, G.I. and Templeton, J.G.C. (1997). Retrial Queues. London: Chapman and Hall.
  • Kapur, J.N. (1989). Maximum Entropy Models in Sciences and Engineering. New York: John Wiley.
  • Kouvatsos, D.D. (1994). Entropy maximization and queueing networks models. Annals of Operations Research, 48, 63-126.
  • Lopez-Herrero, M.J. (2002). On the number of customers served in the M/G/1 retrial queue: First moments and maximum entropy approach. Computers...
  • Lopez-Herrero, M.J. (2004). A maximum entropy approach for the busy period of the M/G/1 retrial queue. Annals of Operations Research (to appear).
  • Nelder, J.A. and Mead, R. (1964). A simplex method for function minimization. Computer Journal, 7, 308- 313.
  • Oganian, A. and Domingo-Ferrer, J. (2003). A posteriori disclosure risk measure for tabular data based on conditional entropy. SORT, 27, 175-190.
  • Press, W.H., Teuklosky, S.A., Vetterling, W.T. and Flannery, B.P. (1992). Numerical Recipes in Fortan. The Art of Scientific Computing. Cambridge:...
  • Shore, J.E. and Johnson, R.W. (1981). Properties of cross-entropy minimization. IEEE Transactions on Information Theory, 27, 472-482.
  • Smolders, S.M.P. and Urbach, H.P. (2002). On the determination of dopant-concentration profiles by grazing emission X-ray fluorescence spectroscopy...
  • Tadj, L. and Hamdi, A. (2001). Maximum entropy solution to a quorum queueing system. Mathematical and Computer Modelling, 34, 19-27.
  • Wang, K.H., Chuang, S.L. and Pearn, W.L. (2002). Maximum entropy analysis to the N policy M/G/1 queueing systems with a removable server....