A selective ARQ protocol with a finite-length buffer |
| |
Authors: | Benelli G |
| |
Affiliation: | Dipartimento di Ingegneria Elettronica, Pavia Univ.; |
| |
Abstract: | 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+Na , Na⩾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 |
| |
Keywords: | |
|
|