What is it about?
Tandem queues with finite buffer capacity commonly exist in practical applications. By viewing a tandem queue as an integrated system, an innovative approach has been developed to analyze its performance through insight from Friedman’s reduction method.
Featured Image
Why is it important?
In our approach, the starvation at the bottleneck caused by service time randomness is modeled by interruptions. Fundamental properties of tandem queues with finite buffer capacity are examined. Without the assumptions of phase-type distributions and stochastic independence, we show that in general, the system service rate of a tandem queue with finite buffer capacity is equal or smaller than its bottleneck service rate, and virtual interruptions, which are the extra idle period at the bottleneck caused by the non-bottlenecks, depend on arrival rates.
Perspectives
Hence, the system service rate is a function of arrival rates when the buffer capacity of a tandem queue is finite. Approximations for the mean queue time of a dual tandem queue have been developed through the concept of virtual interruptions.
Kan Wu
Read the Original
This page is a summary of: Analysis of tandem queues with finite buffer capacity, IISE Transactions, June 2017, Taylor & Francis,
DOI: 10.1080/24725854.2017.1342055.
You can read the full text:
Contributors
The following have contributed to this page
