Bounds on the throughput performance of ARQ selective-repeat protocol in Markov channels

In this paper, we consider the ARQ selective repeat protocol with time-out mechanism, in the presence of Markovian errors on both the forward and the feedback communication channels. Renewal theory is used in order to find performance bounds for the protocol. This technique makes it possible to overcome the computational complexity of an exact analytical approach. Simulation results, that confirm the analysis and document the accuracy of the bounds are also presented. An application to mobile radio is also discussed.