Avram, F. y Gómez-Corral, Antonio (2006) On bulk-service MAP/PHL,N/1/N G-Queues with repeated attempts. Annals of Operations Research , 141 (1). pp. 109-137. ISSN 0254-5330
Restringido a Sólo personal autorizado del repositorio hasta 2020.
|URL||Tipo de URL|
We consider a retrial queue with a finite buffer of size N, with arrivals of ordinary units and of negative units (which cancel one ordinary unit), both assumed to be Markovian arrival processes. The service requirements are of phase type. In addition, a PHL,N bulk service discipline is assumed. This means that the units are served in groups of size at least L, where 1 <= L <= N. If at the completion of a service fewer than L units are present at the buffer, the server switches off and waits until the buffer length reaches the threshold L. Then it switches on and initiates service for such a group of units. On the contrary, if at the completion of a service L or more units are present at the buffer, all units enter service as a group. Units arriving when the buffer is full are not lost, but they join a group of unsatisfied units called "orbit". Our interest is in the continuous-time Markov chain describing the state of the queue at arbitrary times, which constitutes a level dependent quasi-birth-and-death process. We start by analyzing a simplified version of our queueing model, which is amenable to numerical calculation and is based on spatially homogeneous quasi-birth-and-death processes. This leads to modified matrix-geometric formulas that reveal the basic qualitative properties of our algorithmic approach for computing performance measures.
|Tipo de documento:||Artículo|
|Palabras clave:||Bulk-service . Finite-buffer . Markovian arrival process . Phase type distribution . Quasi-birth-and-death process . Repeated attempts|
|Materias:||Ciencias > Matemáticas > Procesos estocásticos|
|Depositado:||13 Jun 2012 10:13|
|Última Modificación:||08 Mar 2016 15:40|
Descargas en el último año
Sólo personal del repositorio: página de control del artículo