A DISCRETE-TIME Geo/G/1 RETRIAL QUEUE WITH SERVER BREAKDOWNS

This paper discusses a discrete-time Geo/G/1 retrial queue with the server subject to breakdowns and repairs. The customer just being served before server breakdown completes his remaining service when the server is fixed. The server lifetimes are assumed to be geometrical and the server repair times are arbitrarily distributed. We study the Markov chain underlying the considered queueing system and present its stability condition as well as some performance measures of the system in steady-state. Then, we derive a stochastic decomposition law and as an application we give bounds for the proximity between the steady-state distributions of our system and the corresponding system without retrials. Also, we introduce the concept of generalized service time and develop a recursive procedure to obtain the steady-state distributions of the orbit and system size. Finally, we prove the convergence to the continuous-time counterpart and show some numerical results.