The search functionality is under construction.

The search functionality is under construction.

It has been shown that the performances of single-receiver ARQ schemes are largely dependent on the packet-error process, i.e., for dependent packet-error environment, they are under- or over- estimated by analyzing them under the assumption that packet-errors occur at random. While, multi-receiver ARQ's have not been analyzed and evaluated for dependent packet-error process. In this paper, we analyze the throughput efficiency of the fundamental multi-receiver Go-back-N ARQ scheme, which can be implemented very simply, over an unreliable channel modeled by the two-state Markov process. Any receiver erroneously receives a packet with probability inherent to each state. From numerical results, we show that the throughput efficiency of the fundamental multi-receiver Go-Back-N ARQ scheme depends on the number of receivers, round-trip-delay, and the characteristic of the Markov process. Also we show that the throughput efficiency of the fundamental multi-receiver Go-Back-N ARQ scheme for larger decay factor and larger difference between packet error probability at each state is considerably better than that for the random error pattern.

- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E85-A No.6 pp.1371-1378

- Publication Date
- 2002/06/01

- Publicized

- Online ISSN

- DOI

- Type of Manuscript
- PAPER

- Category
- Reliability, Maintainability and Safety Analysis

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

Satomi AMAKI, Masaharu KOMATSU, "Throughput Efficiency of the Fundamental Multi-Receiver Go-Back-N ARQ Scheme over a Dependent Packet-Error Channel" in IEICE TRANSACTIONS on Fundamentals,
vol. E85-A, no. 6, pp. 1371-1378, June 2002, doi: .

Abstract: It has been shown that the performances of single-receiver ARQ schemes are largely dependent on the packet-error process, i.e., for dependent packet-error environment, they are under- or over- estimated by analyzing them under the assumption that packet-errors occur at random. While, multi-receiver ARQ's have not been analyzed and evaluated for dependent packet-error process. In this paper, we analyze the throughput efficiency of the fundamental multi-receiver Go-back-N ARQ scheme, which can be implemented very simply, over an unreliable channel modeled by the two-state Markov process. Any receiver erroneously receives a packet with probability inherent to each state. From numerical results, we show that the throughput efficiency of the fundamental multi-receiver Go-Back-N ARQ scheme depends on the number of receivers, round-trip-delay, and the characteristic of the Markov process. Also we show that the throughput efficiency of the fundamental multi-receiver Go-Back-N ARQ scheme for larger decay factor and larger difference between packet error probability at each state is considerably better than that for the random error pattern.

URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e85-a_6_1371/_p

Copy

@ARTICLE{e85-a_6_1371,

author={Satomi AMAKI, Masaharu KOMATSU, },

journal={IEICE TRANSACTIONS on Fundamentals},

title={Throughput Efficiency of the Fundamental Multi-Receiver Go-Back-N ARQ Scheme over a Dependent Packet-Error Channel},

year={2002},

volume={E85-A},

number={6},

pages={1371-1378},

abstract={It has been shown that the performances of single-receiver ARQ schemes are largely dependent on the packet-error process, i.e., for dependent packet-error environment, they are under- or over- estimated by analyzing them under the assumption that packet-errors occur at random. While, multi-receiver ARQ's have not been analyzed and evaluated for dependent packet-error process. In this paper, we analyze the throughput efficiency of the fundamental multi-receiver Go-back-N ARQ scheme, which can be implemented very simply, over an unreliable channel modeled by the two-state Markov process. Any receiver erroneously receives a packet with probability inherent to each state. From numerical results, we show that the throughput efficiency of the fundamental multi-receiver Go-Back-N ARQ scheme depends on the number of receivers, round-trip-delay, and the characteristic of the Markov process. Also we show that the throughput efficiency of the fundamental multi-receiver Go-Back-N ARQ scheme for larger decay factor and larger difference between packet error probability at each state is considerably better than that for the random error pattern.},

keywords={},

doi={},

ISSN={},

month={June},}

Copy

TY - JOUR

TI - Throughput Efficiency of the Fundamental Multi-Receiver Go-Back-N ARQ Scheme over a Dependent Packet-Error Channel

T2 - IEICE TRANSACTIONS on Fundamentals

SP - 1371

EP - 1378

AU - Satomi AMAKI

AU - Masaharu KOMATSU

PY - 2002

DO -

JO - IEICE TRANSACTIONS on Fundamentals

SN -

VL - E85-A

IS - 6

JA - IEICE TRANSACTIONS on Fundamentals

Y1 - June 2002

AB - It has been shown that the performances of single-receiver ARQ schemes are largely dependent on the packet-error process, i.e., for dependent packet-error environment, they are under- or over- estimated by analyzing them under the assumption that packet-errors occur at random. While, multi-receiver ARQ's have not been analyzed and evaluated for dependent packet-error process. In this paper, we analyze the throughput efficiency of the fundamental multi-receiver Go-back-N ARQ scheme, which can be implemented very simply, over an unreliable channel modeled by the two-state Markov process. Any receiver erroneously receives a packet with probability inherent to each state. From numerical results, we show that the throughput efficiency of the fundamental multi-receiver Go-Back-N ARQ scheme depends on the number of receivers, round-trip-delay, and the characteristic of the Markov process. Also we show that the throughput efficiency of the fundamental multi-receiver Go-Back-N ARQ scheme for larger decay factor and larger difference between packet error probability at each state is considerably better than that for the random error pattern.

ER -