Portal de Periódicos da CAPES

A selective ARQ protocol with a finite-length buffer

1993; IEEE Communications Society; Volume: 41; Issue: 7 Linguagem: Inglês

10.1109/26.231941

1558-0857

G. Benelli,

Coding theory and cryptography

Of the automatic-repeat-request (ARQ) techniques commonly used in communication systems, selective protocols, while the most efficient, have the notable drawback of requiring large buffers at the receiver side. A selective ARQ protocol with a finite-length buffer is described. If N is the number of codewords transmittable in the round-trip delay, the protocol requires a buffer length N+N/sub a/, N/sub a/>or=2 being an integer. A lower bound on the throughput of the protocol is derived. It achieves higher throughputs than similar schemes giving results comparable to those for selective protocols with infinite-length buffer for high error rates in the communication channel. >