The throughput efficiency of go-back-N ARQ scheme for burst-error channels

Tsern-Huei Lee*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The limiting throughput efficiency of the classic go-back-N automatic repeat request (ARQ) scheme for burst-error channels described by E. N. Gilbert's (1960) two-state Markov model is evaluated based on regenerative theorems. In Gilbert's model, the channel has two possible states, a quiet state and a noisy state. Let p and q denote respectively the probabilities of transition from the quiet state or the noisy state to itself. Numerical results reveal that the classic go-back-N ARQ scheme performs better under Gilbert's model than an independent error model if and only if p + q ≥ 1. The technique presented can be applied to evaluate the performance of a wide variety of ARQ schemes for burst-error channels.

Original languageEnglish
Title of host publicationNetworking in the 90s
PublisherPubl by IEEE
Pages773-780
Number of pages8
ISBN (Print)0879426942
DOIs
StatePublished - 7 Apr 1991
EventProceedings of the 10th Annual Joint Conference of the IEEE and Communications Societies - IEEE INFOCOM '91 - Bal Harbour, FL, USA
Duration: 7 Apr 199111 Apr 1991

Publication series

NameProceedings - IEEE INFOCOM
Volume2
ISSN (Print)0743-166X

Conference

ConferenceProceedings of the 10th Annual Joint Conference of the IEEE and Communications Societies - IEEE INFOCOM '91
CityBal Harbour, FL, USA
Period7/04/9111/04/91

Fingerprint Dive into the research topics of 'The throughput efficiency of go-back-N ARQ scheme for burst-error channels'. Together they form a unique fingerprint.

Cite this