On the single-server queueing system with fixed number of retrials

The single-server exponential queueing system without the buffer and with a fixed number, m, of retrials is considered. The aim of the paper is to analyze this queueing model. An approach based on the concept of recurrent relationship between the steady-state distribution of the underlying Markov process and the number of retrials m, is proposed. A recurrent algorithm to calculate the steady-state distribution is constructed. On the basis of this algorithm, the mean queue length of retrial customers and some other important system efficiency measures can be calculated.