Título:
|
Algorithmic analysis of the maximum queue length in a busy period for the M/M/c retrial queue
|
Autores:
|
Artalejo, Jesús R. ;
Economou, A. ;
Lopez-Herrero, M. J.
|
Tipo de documento:
|
texto impreso
|
Editorial:
|
Informs, 2007
|
Dimensiones:
|
application/pdf
|
Nota general:
|
info:eu-repo/semantics/restrictedAccess
|
Idiomas:
|
|
Palabras clave:
|
Estado = Publicado
,
Materia = Ciencias: Matemáticas: Investigación operativa
,
Tipo = Artículo
|
Resumen:
|
This paper deals with the maximum number of customers in orbit (and in the system) during a busy period for the M/M/c retrial queue. Determining the distribution for the maximum number of customers in orbit is reduced to computation of certain absorption probabilities. By reducing to the single-server case we arrive at a closed analytic formula. For the multi-server case we develop an efficient algorithmic procedure for computation of this distribution by exploiting the special block-tridiagonal structure of the system. Numerical results illustrate the efficiency of the method and reveal interesting facts concerning the behavior of the M/M/c retrial queue.
|
En línea:
|
https://eprints.ucm.es/id/eprint/15270/1/arta16.pdf
|