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

SORT

Volumn 29, Issue 1, 2005, Pages 119-137

  Artalejo, J R ^a   Lopez Herrero, M J ^a  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

Author keywords

Busy period; Limiting distribution; M G 1 retrial queue; Principle of maximum entropy; Waiting time

Indexed keywords

EID: 23844500694     PISSN: 16962281     EISSN: 20138830     Source Type: Journal    
DOI: None     Document Type: Article

References (21)

1. Agmon, N., Alhassid, Y. and Levine, R.D. (1979). An algorithm for finding the distribution of maximal entropy. Journal of Computational Physics, 30, 250-258.
2. Aissani, A. and Smail, R. (2003). Information theoretic approximations for the M/G/1 retrial queue with unreliable server (preprint).
3. Artalejo, J.R. (1999a). Accessible bibliography on retrial queues. Mathematical and Computer Modelling, 30, 1-6.
4. Artalejo, J.R. (1999b). A classified bibliography of research on retrial queues: Progress in 1990-1999. Top, 7, 187-211.
5. Artalejo, J.R. and Gomez-Corral, A. (1995). Information theoretic analysis for queueing systems with quasi-random input. Mathematical and Computer Modelling, 22, 65-76.
6. 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. (Pubitemid 30563278)
7. 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 Journal of Operational Research, 19, 131-148.
8. 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 Stochastic Modelling, R. Gutiérrrez and M.J. Valderrama (eds.), World Scientific, 181-190.
9. Falin, G.I., Martin, M. and Artalejo, J.R. (1994). Information theoretic approximations for the M/G/1 retrial queue. Acta Informatica, 31, 559-571.
10. Falin, G.I. and Templeton, J.G.C. (1997). Retrial Queues. London: Chapman and Hall.
11. Kapur, J.N. (1989). Maximum Entropy Models in Sciences and Engineering. New York: John Wiley.
12. Kouvatsos, D.D. (1994). Entropy maximization and queueing networks models. Annals of Operations Research, 48, 63-126.
13. 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 and Operations Research, 29, 1739-1757.
14. 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).
15. Nelder, J.A. and Mead, R. (1964). A simplex method for function minimization. Computer Journal, 7, 308-313.
16. Oganian, A. and Domingo-Ferrer, J. (2003). A posteriori disclosure risk measure for tabular data based on conditional entropy. SORT, 27, 175-190.
17. Press, W.H., Teuklosky, S.A., Vetterling, W.T. and Flannery, B.P. (1992). Numerical Recipes in Fortan. The Art of Scientific Computing. Cambridge: Cambridge University Press.
18. Shore, J.E. and Johnson, R.W. (1981). Properties of cross-entropy minimization. IEEE Transactions on Information Theory, 27, 472-482.
19. Smolders, S.M.P. and Urbach, H.P. (2002). On the determination of dopant-concentration profiles by grazing emission X-ray fluorescence spectroscopy using the maximum-entropy method. Journal of Engineering Mathematics, 43, 115-134. (Pubitemid 35162008)
20. Tadj, L. and Hamdi, A. (2001). Maximum entropy solution to a quorum queueing system. Mathematical and Computer Modelling, 34, 19-27. (Pubitemid 32827882)
21. 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. Applied Mathematical Modelling, 26, 1151-1162.