The performance of various ARQ protocols has recently been analyzed for multidestination environments. In all previous work, the round-trip delays between the transmitter and each of the receivers are assumed (or forced) to be equal to the maximum one, to simplify the analysis and/or the operation. This assumption obviously will sacrifice the system performance. In this paper, we evaluate the throughput efficiencies of three multidestination GBN ARQ protocols under unequal round-trip delays. In the investigated protocols, multiple copies of each data block are (re)transmitted contiguously to the receivers. Tight lower bounds are obtained for the throughput efficiencies of the schemes in which each data block is transmitted with the optimum number of copies. Results show that assuming all the round-trip delays to be equal to the maximum one may sacrifice the performance significantly. We also compare the performances of the three investigated protocols. In general, the performance becomes better as the transmitter utilizes more of the outcomes of previous transmission attempts.
|Number of pages||11|
|Journal||IEICE Transactions on Communications|
|State||Published - 1 Nov 1993|