Name
Abstract | ||
|---|---|---|
Automatic repeat request (ARQ) techniques with error-detecting codes are commonly used in communication systems. Of these, selective protocols, while the most efficient, have the notable drawback of requiring large 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 of codewords transmittable in the round-trip delay, the described protocol 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 of the described ARQ protocol is derived. The proposed protocol achieves higher throughputs than similar schemes, giving comparable results to selective protocols with infinite-length buffers for high error rates in the communication channel. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1002/ett.4460060316 | EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS |
Field | DocType | Volume |
Hybrid automatic repeat request,Sliding window protocol,Computer science,Selective Repeat ARQ,Computer network,Error detection and correction,Go-Back-N ARQ,Automatic repeat request,Throughput,Channel capacity | Journal | 6 |
Issue | ISSN | Citations |
3 | 1120-3862 | 0 |
PageRank | References | Authors |
0.34 | 9 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Giuliano Benelli | 1 | 41 | 15.13 |
| Andrea Garzelli | 2 | 574 | 41.36 |