Universidad Complutense de Madrid
E-Prints Complutense

Algorithmic approximations for the busy period distribution of the M/M/c retrial queue



Último año

Artalejo, Jesús R. y Economou, A. y López Herrero, María Jesús (2007) Algorithmic approximations for the busy period distribution of the M/M/c retrial queue. European journal of operational research, 176 (3). pp. 1687-1702. ISSN 0377-2217

[img] PDF
Restringido a Sólo personal autorizado del repositorio hasta 31 Diciembre 2020.


URL Oficial: http://www.sciencedirect.com/science/article/pii/S0377221705008684

URLTipo de URL


In this paper we deal with the main multiserver retrialqueue of M/M/c type with exponential repeated attempts. This model is known to be analytically intractable due to the spatial heterogeneity of the underlying Markov chain, caused by the retrial feature. For this reason several models have been proposed for approximating its stationary distribution, that lead to satisfactory numerical implementations. This paper extends these studies by developing efficient algorithmic procedures for calculating the busyperioddistribution of the main approximation models of Wilkinson [Wilkinson, R.I., 1956. Theories for toll traffic engineering in the USA, The Bell System Technical Journal 35, 421–514], Falin [Falin, G.I., 1983. Calculations of probability characteristics of a multiline system with repeated calls, Moscow University Computational Mathematics and Cybernetics 1, 43–49] and Neuts and Rao [Neuts, M.F., Rao, B.M., 1990. Numerical investigation of a multiserver retrial model, Queueing Systems 7, 169–190]. Moreover, we develop stable recursive schemes for the computation of the busyperiod moments. The corresponding distributions for the total number of customers served during a busyperiod are also studied. Several numerical results illustrate the efficiency of the methods and reveal interesting facts concerning the behavior of the M/M/cretrialqueue.

Tipo de documento:Artículo
Información Adicional:

The authors thank the support received from the research project MTM2005-01248. A. Economou was supported by the University of Athens grant ELKE/70/4/6415 and by the Greek Ministry of Education and European Union program PYTHAGORAS/2004.

Palabras clave:Queueing; M/M/c retrial queue; Generalized truncation models; Busy period; First-step analysis;Numerical inversion; Algorithmic probability
Materias:Ciencias > Matemáticas > Investigación operativa
Código ID:15455
Depositado:01 Jun 2012 10:47
Última Modificación:06 Feb 2014 10:24

Descargas en el último año

Sólo personal del repositorio: página de control del artículo