Resequencing Delay in the Selective-Repeat ARQ Scheme

Masaharu KOMATSU

Copy

Masaharu KOMATSU, "Resequencing Delay in the Selective-Repeat ARQ Scheme" in IEICE TRANSACTIONS on transactions, vol. E73-E, no. 6, pp. 867-869, June 1990, doi: .
Abstract: The basic selective-repeat ARQ scheme can achieve very high throughput. However, it encounters a resequencing problem. We analyze the average resequencing delay approximately under the assumption that the arrivals of NAK's are totally independent of the past history of the system. And, we examine its characteristics from numerical examples.
URL: https://globals.ieice.org/en_transactions/transactions/10.1587/e73-e_6_867/_p

Copy

@ARTICLE{e73-e_6_867,
author={Masaharu KOMATSU, },
journal={IEICE TRANSACTIONS on transactions},
title={Resequencing Delay in the Selective-Repeat ARQ Scheme},
year={1990},
volume={E73-E},
number={6},
pages={867-869},
abstract={The basic selective-repeat ARQ scheme can achieve very high throughput. However, it encounters a resequencing problem. We analyze the average resequencing delay approximately under the assumption that the arrivals of NAK's are totally independent of the past history of the system. And, we examine its characteristics from numerical examples.},
keywords={},
doi={},
ISSN={},
month={June},}

Copy

TY - JOUR
TI - Resequencing Delay in the Selective-Repeat ARQ Scheme
T2 - IEICE TRANSACTIONS on transactions
SP - 867
EP - 869
AU - Masaharu KOMATSU
PY - 1990
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E73-E
IS - 6
JA - IEICE TRANSACTIONS on transactions
Y1 - June 1990
AB - The basic selective-repeat ARQ scheme can achieve very high throughput. However, it encounters a resequencing problem. We analyze the average resequencing delay approximately under the assumption that the arrivals of NAK's are totally independent of the past history of the system. And, we examine its characteristics from numerical examples.
ER -