Universidad Complutense de Madrid
E-Prints Complutense

A. B. Clarke's Tandem Queue Revisited-Sojourn Times



Último año

Gómez-Corral, Antonio y Escribano Martos, Manuel David (2008) A. B. Clarke's Tandem Queue Revisited-Sojourn Times. Stochastic Analysis and Applications, 26 (6). pp. 1111-1135. ISSN 0736-2994

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


URL Oficial: http://www.tandfonline.com/doi/pdf/10.1080/07362990802285998

URLTipo de URL


In telecommunications, packets or units may complete their service in a different order from the one in which they enter the station. In order to reestablish the original order resequencing protocols need to be implemented. In this article, the focus is on a two-server resequencing system with heterogeneous servers and two buffers. One buffer has an infinite capacity to hold the incoming units. The other with a finite capacity is used to resequence the serviced units. This is to maintain the order of departure of the units according to the order of their arrivals. To analyze this resequencing model, we introduce an equivalent two-stage queueing system, namely A. B. Clarke's Tandem Queue, in which the arriving units receive service from only one server, and the units departing from the first stage may be temporally prevented from leaving by occupied service units at the second stage. Our interest is to study the resequencing delay and the sojourn time as times until absorption in suitably defined quasi-birth-and-death processes and continuous-time Markov chains.

Tipo de documento:Artículo
Palabras clave:Blocking; Resequencing; Sojourn times; Queueing
Materias:Ciencias > Matemáticas > Procesos estocásticos
Código ID:15595
Depositado:13 Jun 2012 07:59
Última Modificación:08 Mar 2016 15:07

Descargas en el último año

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