Performance of ARQ Go-Back-N protocol in Markov channels with unreliable feedback
- 119 Downloads
In this paper, an ARQ Go-Back-N protocol with time-out mechanism is studied. Transmissions on both the forward and the reverse channels are assumed to be subject to Markovian errors. A recently developed approach, based on renewal theory, is further extended and the steady state average number of packets in the ARQ system is evaluated. This allows us to determine analytically both throughput and transmission delay of the system. Simulation results, that confirm the analysis, are also presented. Based on the analysis, the trade-off involved in the choice of the time-out parameter is identified and discussed.
KeywordsAverage Throughput Throughput Analysis Delay Analysis Average Packet Delay Markov Chain Approach
Unable to display preview. Download preview PDF.
- D. Bertsekas and R. Gallager, Data Networks (Prentice-Hall, 1992).Google Scholar
- E.N. Gilbert, Capacity of a burst-noise channel, Bell System Tech. Journal 39 (September 1960) 1253–1266.Google Scholar
- R.A. Howard, Dynamic Probabilistic Systems (Wiley, New York, 1971).Google Scholar
- S.H. Ross, Stochastic Processes (Wiley, New York, 1983).Google Scholar
- M. Zorzi and R.R. Rao, Throughput analysis of ARQ Go-Back-N protocol in Markov channels with unreliable feedback, in: ’95 (June 1995) pp. 1232–1237.Google Scholar
- M. Zorzi and R.R. Rao, Performance of ARQ Go-Back-N protocol in Markov channels with unreliable feedback: Delay analysis, in: ’95 (November 1995) pp. 481–485.Google Scholar
- M. Zorzi, R.R. Rao and L.B. Milstein, On the accuracy of a first-order Markov model for data block transmission on fading channels, in: ’95 (November 1995) pp. 211–215.Google Scholar