A new approach is proposed for the investigation of the characteristics of queueing systems of the M/G/1/b-type with finite waiting rooms and a resume level of the input flow. A convenient algorithm is proposed for the numerical evaluation of stationary parameters of the system. Its efficiency is demonstrated for a specific system.
Similar content being viewed by others
References
H. Takagi, “Analysis of a finite-capacity M/G/1 queue with a resume level,” Perform. Eval., 5, No. 3, 197–203 (1985).
H. Takagi, Queueing Analysis, Vol. 2, Elsevier, Amsterdam (1993).
T. S. S. Srinivasa Rao and U. C. Gupta, “A simple method for computing state probabilities of the M/G/1 and GI/N/1 finite waiting space queues,” ZOR-Math. Met. Operat. Res., 43, 97–106 (1996).
M. Bratiychuk and B. Borowska, “Explicit formulae and convergence rate for the system E/G/1/N,” Comm. Statist. Stochast. Models, 18, 71–78 (2001).
V. S. Korolyuk, Boundary Problems for Compound Poisson Process [in Russian], Naukova Dumka, Kiev (1975).
Author information
Authors and Affiliations
Additional information
Translated from Ukrains’kyi Matematychnyi Zhurnal, Vol. 66, No. 1, pp. 30–40, January, 2014.
Rights and permissions
About this article
Cite this article
Bratiichuk, M.S., Sliwinska, D. Queueing Systems with Resume Level. Ukr Math J 66, 30–41 (2014). https://doi.org/10.1007/s11253-014-0909-8
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11253-014-0909-8