|
Título:
|
Analysis of the busy period for the M/M/c queue: An algorithmic approach
|
|
Autores:
|
Artalejo, Jesús R. ;
Lopez-Herrero, M. J.
|
|
Tipo de documento:
|
texto impreso
|
|
Editorial:
|
Applied Probability Trust, 2001-03
|
|
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 presents an algorithmic analysis of the busy period for the M/M/c queueing system. By setting the busy period equal to the time interval during which at least one server is busy, we develop a first step analysis which gives the Laplace-Stieltjes transform of the busy period as the solution of a finite system of linear equations. This approach is useful in obtaining a suitable recursive procedure for computing the moments of the length of a busy period and the number of customers served during it. The maximum entropy formalism is then used to analyse what is the influence of a given set of moments on the distribution of the busy period and to estimate the true busy period distribution. Our study supplements a recent work of Daley and Servi (1998) and other studies where the busy period of a multiserver queue follows a different definition, i.e., a busy period is the time interval during which all servers are engaged.
|
|
En línea:
|
https://eprints.ucm.es/id/eprint/15826/1/arta49.pdf
|
