Abstract
A retrial single-server queueing system with finite buffer is considered. The primary incoming flow is Poissonian. If the buffer is overflown, a call entering the system becomes a repeat call and joins the group of repeat calls referred to as an orbit. The maximum number of calls that can simultaneously be contained in the orbit is limited. A call from the orbit makes new attempts to enter the system until a vacancy occurs. Time between repeat attempts for each call is an exponentially distributed random variable. At the initial moment of service, a type of a call is defined: with probability a i it becomes a call of type i and its service time in this case has distribution function B i (x), i = \(\overline {1,K}\). For this system, the stationary joint distribution of queues in the buffer and orbit is found. Numerical examples are given.
Similar content being viewed by others
REFERENCES
Stepanov, S.N., Chislennye metody rascheta modelei s povtornymi vyzovami (Numerical Computation Methods for Retrial Models), Moscow: Nauka, 1983.
Falin, G.I. and Templeton, J.G.G., Retrial Queues, London: Chapman & Hall, 1997.
Grishechkin, S.A., Branching Processes and Retrial or Random-Discipline Systems, Teor. Veroyatn. Primen., 1990, vol. 35,no. 1, pp. 35-50.
Bocharov, P.P., Pavlova, O.I., and Puzikova, D.A., M/G/1/r Retrial Queueing Systems with Priority of Primary Customers, Math. Comput. Modelling, 1999, vol. 30, pp. 89-98.
Bocharov, P.P., Pechinkin, A.V., and Phong, N.H., Steady State Probabilites for a Retrial MAP/G/1/r System with Priority of Primary Calls, Avtomat. Telemekh., 2000, no. 8, pp. 68-78.
Bocharov, P.P. and Pechinkin, A.V., Queueing Theory, Moscow: Ross. Univ. Druzhby Narodov, 1995.
Bocharov, P.P. and Phong, N.H., Retrial Queues with Several Input Flows, Proc. Int. Conf. on Stochastic Processes and Their Applications, Cochin, India, 1999.
Rights and permissions
About this article
Cite this article
Bocharov, P.P., D'Apice, C. & Phong, N.H. On a Retrial Single-Server Queueing System with Finite Buffer and Poisson Flow. Problems of Information Transmission 37, 248–261 (2001). https://doi.org/10.1023/A:1013882108415
Issue Date:
DOI: https://doi.org/10.1023/A:1013882108415