Title :
Analysis of Selective-Repeat ARQ via Matrix Signal-Flow Graphs
Author :
Ausavapattanakun, Kamtorn ; Nosratinia, Aria
Author_Institution :
Dept. of Electr. Eng., Texas Univ., Richardson, TX
Abstract :
In this paper, we present a new method to analyze the throughput and delay of the selective-repeat (SR) automatic repeat-request (ARQ) protocol. Previous work on SR ARQ has concentrated on reliable feedback or two-state Markovian feedback errors. We solve a wider class of problems by characterizing both the forward and reverse channels by general hidden Markov models (HMMs). The moment-generating function (MGF) technique is used to find throughput and delay. To calculate the MGF, we construct matrix signal-flow graphs for the hidden Markov process. This procedure can be useful for a variety of other HMM problems, and is of interest by itself. Practical issues such as erasure errors and timeouts are included in our analyses, which are verified by extensive simulations
Keywords :
automatic repeat request; hidden Markov models; matrix algebra; signal flow graphs; telecommunication channels; automatic repeat-request protocol; erasure errors; forward channels; hidden Markov models; matrix signal-flow graphs; moment-generating function technique; reverse channels; selective-repeat ARQ protocol; timeouts; Analytical models; Automatic repeat request; Delay; Feedback; Hidden Markov models; Protocols; Signal analysis; Signal processing; Strontium; Throughput; Automatic repeat-request (ARQ); delay; hidden Markov model (HMM); selective-repeat (SR) protocol; throughput;
Journal_Title :
Communications, IEEE Transactions on
DOI :
10.1109/TCOMM.2006.885092
