Abstract
Busy periods of finite buffer tandem service systems have not been addressed in the available literature. This paper defines the stage‐I and stage‐II busy periods of a two‐stagetandem service system M (x)/M/c → /PH(r)/1/K, analytically obtains their distributions, and presents efficient algorithms for the distributions with uniform error in time. The detailed analysis and algorithmic implementation for the two‐stage tandem service system are completed, and the theoretical basis for its potential practical applications is provided.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G.H. Hsu and X.M. Yuan, First passage times: Busy periods and waiting times, Science in China, Ser. A, 38(1995)1187-1201.
G.H. Hsu and X.M. Yuan, The first passage times and their algorithms for Markov processes, Stochastic Models 11(1995)195-210.
G.H. Hsu and X.M. Yuan, Stationary behavior of the queueing system M (x)/M/c → /PH (r)/1/K, J. Sys. Sci. and Math. Scis. 12(1992)317-325.
G.H. Hsu and X.M. Yuan, The queueing system M (x)/M/c → /PH (r)/1/K, Appl. Math.-J. Chin. Univ. 7(1992)422-432.
A.G. Konheim and M.F. Reiser, Queueing model with finite waiting room and blocking, J. of ACM 23(1976)328-341.
G. Latouche and M.F. Neuts, Efficient algorithmic solution to exponential tandem queues with blocking, SIAM J. Alg. Discr. Meth. 1(1980)93-106.
M.F. Neuts, Matrix-Geometric Solution in Stochastic Models, Johns Hopkins University Press, Baltimore, 1981.
X.M. Yuan, A low-dimensional algorithm for the queue length of the system M (x)/M/c → /PH (r)/1/K, Proceedings of the ORSC'94, Wuhan, 1994.
Rights and permissions
About this article
Cite this article
Yuan, XM. Busy periods of two‐stage tandem service systems and their algorithmic implementation. Annals of Operations Research 87, 319–332 (1999). https://doi.org/10.1023/A:1018945305772
Issue Date:
DOI: https://doi.org/10.1023/A:1018945305772