Abstract
Definitions of blocking types for tandem queueing systems are given where each stage consists of multiple servers. Some of them are shown to be identical with respect to service initiation epochs at each stage. Such identical relationships are proved using sample path correspondence, and are therefore valid irrespective of the arrival process and the service time distributions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
T.M. Altiok and S. Stidham Jr., A note on transfer lines with unreliable machines, random processing times, and finite buffers, IIE Trans. 14 (1982) 125–127.
M.H. Ammar and S.B. Gershwin, Equivalence relations in queueing models of fork/join networks with blocking, Perf. Eval. 10 (1989) 233–246.
R.O. Onvural and H.G. Perros, On equivalencies of blocking mechanisms in queueing networks with blocking, Oper. Res. Lett. 5 (1986) 293–297.
R.O. Onvural and H.G. Perros, Some equivalencies between closed queueing networks with blocking, Perf. Eval. 9 (1988/89) 111–118.
R.O. Onvural and H.G. Perros, Equivalencies between open and closed queueing networks with finite buffers, Perf. Eval. 9 (1988/89) 263–269.
H. Sakasegawa, Numerical algorithms to solve network queueing models with blocking, Discussion Paper No. 468, Institute of Socio-Economic Planning, University of Tsukuba (1991).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sakasegawa, H., Kawashima, T. On the equivalence of three types of blocking in non-Markovian tandem queues. Queueing Syst 16, 301–310 (1994). https://doi.org/10.1007/BF01158959
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01158959