Abstract
A single-server queueing system with recurrent input flow and Markov service process is considered. Both the cases of finite and infinite buffers are investigated. The analysis of this system is based on the method of embedded Markov chain. The main stationary characteristics of system performance are derived.
Similar content being viewed by others
REFERENCES
Bocharov, P.P., Steady-State Distribution of a Finite Queue with Recurrent Input and Markov Service, Avtom. Telemekh., 1996, no. 9, pp. 66-78.
Bocharov, P.P. and Pechinkin, A.V., Teoriya massovogo obsluzhivaniya (Queueing Theory), Moscow: Ross. Univ. Druzhby Narodov, 1995.
Bocharov, P.P., D'Apice, C., Pechinkin, A.V., and Phong, N.H., Single-Server Queueing System of Finite Capacity with Batch Arrivals and Semi-Markovian Service, Vestn. Ross. Univ. Druzhby Narodov, Ser. Prikl. Mat. Inf., 2001, no. 1, pp. 64-79.
Pechinkin, A.V., Stationary State Probabilities in the System with Markov Input Flow, Non-preemptive Priority and Separate Queues, Avtom. Telemekh., 1998, no. 1, pp. 107-119.
Neuts, M.F., Matrix-Geometric Solutions in Stochastic Models. An Algorithmic Approach, Baltiwore: John Hopkins Univ. Press, 1981.
Machihara, F., A G/SM/1 Queue with Vacations Depending on Service Times, Commun. Statist. Stoch. Models, 1995, vol. 11, no.4, pp. 571-690.
Foster, F.C., On the Stochastic Matrices Associated with Queueing Processes, Ann. Math. Statist., 1953, vol. 24, pp. 350-360.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bocharov, P.P., D'Apice, C., Pechinkin, A.V. et al. The Stationary Characteristics of the G/MSP/1/r Queueing System. Automation and Remote Control 64, 288–301 (2003). https://doi.org/10.1023/A:1022219232282
Issue Date:
DOI: https://doi.org/10.1023/A:1022219232282