Bounds for the expected delays in some tandem queues

1 March 1980

journal article
research article
Published by Cambridge University Press (CUP) in Journal of Applied Probability

Vol. 17 (03) , 831-838
https://doi.org/10.1017/s0021900200033933

Abstract

Tandem queues are analyzed. An upper bound for the stationary expected delay in front of the second server is found for a sequence of two queues in tandem where the first server has deterministic service times, the second server has general service distribution, and the arrival process is an arbitrary renewal process. The result is extended to the case of n queues in tandem where all the servers except the last one have constant service times.

Keywords

This publication has 9 references indexed in Scilit:

The Optimal Order of Service in Tandem Queues
Operations Research, 1974
The Output Process of a Stationary $M/M/s$ Queueing System
The Annals of Mathematical Statistics, 1968
Some Inequalities in Queuing
Operations Research, 1968
Association of Random Variables, with Applications
The Annals of Mathematical Statistics, 1967
Reduction Methods for Tandem Queuing Systems
Operations Research, 1965
Note on Queues in Tandem
The Annals of Mathematical Statistics, 1963
Some inequalities for the queue GI/G/1
Biometrika, 1962
Waiting Times When Queues are in Tandem
The Annals of Mathematical Statistics, 1957
The Output of a Queuing System
Operations Research, 1956