A SELECTIVE ARQ PROTOCOL WITH A FINITE-LENGTH BUFFER

Authors
Citation
G. Benelli, A SELECTIVE ARQ PROTOCOL WITH A FINITE-LENGTH BUFFER, IEEE transactions on communications, 41(7), 1993, pp. 1102-1111
Citations number
16
Categorie Soggetti
Telecommunications,"Engineering, Eletrical & Electronic
ISSN journal
00906778
Volume
41
Issue
7
Year of publication
1993
Pages
1102 - 1111
Database
ISI
SICI code
0090-6778(1993)41:7<1102:ASAPWA>2.0.ZU;2-V
Abstract
Automatic repeat request (ARQ) techniques with error-detecting codes a re commonly used in communication systems. Of these, selective protoco ls, while the most efficient, have the notable drawback of requiring l arge buffers at the receiver side. A new selective ARQ protocol with a finite-length buffer is described in this paper. If N is the number o f codewords transmittable in the round-trip delay, the described proto col requires a buffer having length equal to N + N(a), + N(a) greater- than-or-equal-to 2 being an integer. A lower bound on the throughput o f the described ARQ protocol is derived. The proposed protocol achieve s higher throughputs than similar schemes, giving comparable results t o selective protocols with infinite-length buffers for high error rate s in the communication channel.