I. Atencia, P.P. Bocharov, and P. Moreno

A discrete-time Geo/PH/1 queueing system with repeated attempts

This paper is concerned with the study of a discrete-time single-server retrial queue with geometrical interarrival times and a phase-type service process. We analyze the underlying Markov chain. An iterative algorithm to calculate the stationary distribution of Markov chain is given. By using the Fast Fourier Transform we obtain numerical examples that give the probability distribution of the number of customers in the orbit related to the specific phase in which the service process is.