Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 393

The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.

The Eifel algorithm: making TCP robust against spurious retransmissions

Open access
Ludwig, Reiner, Katz, Randy H.·2000·ACM SIGCOMM Computer Communication Review

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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/505688.505692

Cites

23 of 23 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 23 references

Cited by

See all 393

Metadata

Authors
Ludwig, R., & Katz, R. H.
Venue
ACM SIGCOMM Computer Communication Review
Published
2000-01
Volume
30
Issue
1
Pages
30-36
ISSN
0146-4833 (ISSN-L)
OpenAlex
W2034121590
Cited by
393
References
23
FWCI
25.82
Type
journal article
Language
en
Open access
bronze

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: The Eifel algorithm: making TCP robust against spurious retransmissions. https://app.cochat.ai/papers/10.1145/505688.505692
The paper
Ludwig, R., & Katz, R. H. (2000). The Eifel algorithm: making TCP robust against spurious retransmissions. ACM SIGCOMM Computer Communication Review. https://doi.org/10.1145/505688.505692

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.