The Eifel algorithm
Authors:
Top Cited Papers
Open Access
- 1 January 2000
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM SIGCOMM Computer Communication Review
- Vol. 30 (1) , 30-36
Abstract
We propose an enhancement to TCP's error recovery scheme, which we call the Eifel algorithm . It eliminates the retransmission ambiguity, thereby solving the problems caused by spurious timeouts and spurious fast retransmits. It can be incrementally deployed as it is backwards compatible and does not change TCP's congestion control semantics. In environments where spurious retransmissions occur frequently, the algorithm can improve the end-to-end throughput by several tens of percent. An exact quantification is, however, highly dependent on the path characteristics over time. The Eifel algorithm finally makes TCP truly wireless-capable without the need for proxies between the end points. Another key novelty is that the Eifel algorithm provides for the implementation of a more optimistic retransmission timer because it reduces the penalty of a spurious timeout to a single (in the common case) spurious retransmission.Keywords
This publication has 16 references indexed in Scilit:
- An Extension to the Selective Acknowledgement (SACK) Option for TCP2000
- Packet reordering is not pathological network behaviorIEEE/ACM Transactions on Networking, 1999
- On estimating end-to-end network path properties1999
- Multi-layer tracing of TCP over a reliable wireless link1999
- TCP Congestion Control1999
- IP Header Compression1999
- TCP Extensions for High Performance1992
- Compressing TCP/IP Headers for Low-Speed Serial Links1990
- Congestion avoidance and control1988
- Improving round-trip time estimates in reliable transport protocols1987