Approximate analysis of single-server tandem queues with finite buffers

R. Bierbooms, I.J.B.F. Adan, M. Vuuren, van

Onderzoeksoutput: Boek/rapportRapportAcademic

66 Downloads (Pure)


In this paper we study single-server tandem queues with general service times and finite buffers. Jobs are served according to the Blocking-After-Service protocol. To approximately determine the throughput and mean sojourn time, we decompose the tandem queue into single-buffer subsystems, the service times of which include starvation and blocking, and then iteratively estimate the unknown parameters of the service times of each subsystem. The crucial feature of this approach is that in each subsystem successive service times are no longer assumed to be independent, but a successful attempt is made to include dependencies due to blocking by employing the concept of Markovian service processes. An extensive numerical study shows that this approach produces very accurate estimates for the throughput and mean sojourn time, outperforming existing methods, especially for longer tandem queues and for tandem queues with service times with a high variability.
Originele taal-2Engels
Plaats van productieEindhoven
Aantal pagina's11
StatusGepubliceerd - 2010

Publicatie series

NaamReport Eurandom
ISSN van geprinte versie1389-2355

Vingerafdruk Duik in de onderzoeksthema's van 'Approximate analysis of single-server tandem queues with finite buffers'. Samen vormen ze een unieke vingerafdruk.

Citeer dit