Go-Back-N automatic repeat request (GBN ARQ) and Stop-and wait (SW) ARQ schemes are one of fundamental and widely used error control procedures for data communication and computer communication systems. The throughput and delay performances of these ARQ schemes have been analyzed for a random error channel, which could not applicable for a radio channel, for example. In this paper, considering the correlated, noisy channel, we derive the exact formula for the delay of a frame in GBN and SW ARQ schemes. First, the delay formula for the discrete time M[x]/G/1 queueing system with starter. Next, the virtual service time of a frame is found in terms of the decay factor of a two-state Markov chain. As a result, it is shown that the performance of the delay is improved with the larger decay factor.
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
Yukuo HAYASHIDA, Masaharu KOMATSU, "Delay Analysis of Continuous ARQ Schemes with Markovian Error Channel" in IEICE TRANSACTIONS on Communications,
vol. E77-B, no. 8, pp. 1023-1031, August 1994, doi: .
Abstract: Go-Back-N automatic repeat request (GBN ARQ) and Stop-and wait (SW) ARQ schemes are one of fundamental and widely used error control procedures for data communication and computer communication systems. The throughput and delay performances of these ARQ schemes have been analyzed for a random error channel, which could not applicable for a radio channel, for example. In this paper, considering the correlated, noisy channel, we derive the exact formula for the delay of a frame in GBN and SW ARQ schemes. First, the delay formula for the discrete time M[x]/G/1 queueing system with starter. Next, the virtual service time of a frame is found in terms of the decay factor of a two-state Markov chain. As a result, it is shown that the performance of the delay is improved with the larger decay factor.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e77-b_8_1023/_p
Copy
@ARTICLE{e77-b_8_1023,
author={Yukuo HAYASHIDA, Masaharu KOMATSU, },
journal={IEICE TRANSACTIONS on Communications},
title={Delay Analysis of Continuous ARQ Schemes with Markovian Error Channel},
year={1994},
volume={E77-B},
number={8},
pages={1023-1031},
abstract={Go-Back-N automatic repeat request (GBN ARQ) and Stop-and wait (SW) ARQ schemes are one of fundamental and widely used error control procedures for data communication and computer communication systems. The throughput and delay performances of these ARQ schemes have been analyzed for a random error channel, which could not applicable for a radio channel, for example. In this paper, considering the correlated, noisy channel, we derive the exact formula for the delay of a frame in GBN and SW ARQ schemes. First, the delay formula for the discrete time M[x]/G/1 queueing system with starter. Next, the virtual service time of a frame is found in terms of the decay factor of a two-state Markov chain. As a result, it is shown that the performance of the delay is improved with the larger decay factor.},
keywords={},
doi={},
ISSN={},
month={August},}
Copy
TY - JOUR
TI - Delay Analysis of Continuous ARQ Schemes with Markovian Error Channel
T2 - IEICE TRANSACTIONS on Communications
SP - 1023
EP - 1031
AU - Yukuo HAYASHIDA
AU - Masaharu KOMATSU
PY - 1994
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E77-B
IS - 8
JA - IEICE TRANSACTIONS on Communications
Y1 - August 1994
AB - Go-Back-N automatic repeat request (GBN ARQ) and Stop-and wait (SW) ARQ schemes are one of fundamental and widely used error control procedures for data communication and computer communication systems. The throughput and delay performances of these ARQ schemes have been analyzed for a random error channel, which could not applicable for a radio channel, for example. In this paper, considering the correlated, noisy channel, we derive the exact formula for the delay of a frame in GBN and SW ARQ schemes. First, the delay formula for the discrete time M[x]/G/1 queueing system with starter. Next, the virtual service time of a frame is found in terms of the decay factor of a two-state Markov chain. As a result, it is shown that the performance of the delay is improved with the larger decay factor.
ER -