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.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Tsern-Huei LEE, Jo-Ku HU, "Performance of Some Multidestination GBN ARQ Protocols under Unequal Round-Trip Delays" in IEICE TRANSACTIONS on Communications,
vol. E76-B, no. 11, pp. 1352-1362, November 1993, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e76-b_11_1352/_p
Copy
@ARTICLE{e76-b_11_1352,
author={Tsern-Huei LEE, Jo-Ku HU, },
journal={IEICE TRANSACTIONS on Communications},
title={Performance of Some Multidestination GBN ARQ Protocols under Unequal Round-Trip Delays},
year={1993},
volume={E76-B},
number={11},
pages={1352-1362},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={November},}
Copy
TY - JOUR
TI - Performance of Some Multidestination GBN ARQ Protocols under Unequal Round-Trip Delays
T2 - IEICE TRANSACTIONS on Communications
SP - 1352
EP - 1362
AU - Tsern-Huei LEE
AU - Jo-Ku HU
PY - 1993
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E76-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 1993
AB - 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.
ER -