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 accessAbstract
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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Congestion avoidance and control
Jacobson, V. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205462 · Cited by 5,301
(2011) · SpringerReference · doi:10.1007/springerreference_27387 · Cited by 3,053
Allman, M., Paxson, V., & Blanton, E. (2009) · doi:10.17487/rfc5681 · Cited by 2,523
Congestion avoidance and control
Jacobson, V. (1988) · Symposium proceedings on Communications architectures and protocols · doi:10.1145/52324.52356 · Cited by 2,479
Postel, J. (1981) · doi:10.17487/rfc0793 · Cited by 2,122
The macroscopic behavior of the TCP congestion avoidance algorithm
Mathis, M., Semke, J., Mahdavi, J., & Ott, T. (1997) · ACM SIGCOMM Computer Communication Review · doi:10.1145/263932.264023 · Cited by 1,495
Postel, J. B. (1981) · Cited by 1,130
TCP Extensions for High Performance
Borman, D., Braden, B., & Jacobson, V. (2014) · doi:10.17487/rfc7323 · Cited by 1,010
The BSD packet filter: a new architecture for user-level packet capture
McCanne, S., & Jacobson, V. L. (1993) · Cited by 885
Postel, J. B. (1981) · doi:10.17487/rfc0791 · Cited by 802
TCP Extensions for High Performance
Jacobson, V., Braden, R., & Borman, D. (1992) · doi:10.17487/rfc1323 · Cited by 746
End-to-end routing behavior in the Internet
Paxson, V. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.649563 · Cited by 698
Compressing TCP/IP Headers for Low-Speed Serial Links
Jacobson, V. (1990) · doi:10.17487/rfc1144 · Cited by 427
The Point-to-Point Protocol (PPP)
(1994) · doi:10.17487/rfc1661 · Cited by 412
Packet reordering is not pathological network behavior
Bennett, J. C. R., Partridge, C., & Shectman, N. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.811445 · Cited by 402
An Extension to the Selective Acknowledgement (SACK) Option for TCP
Floyd, S., Mahdavi, J., Mathis, M., & Podolsky, M. (2000) · doi:10.17487/rfc2883 · Cited by 370
On estimating end-to-end network path properties
Allman, M., & Paxson, V. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316230 · Cited by 344
Degermark, M., Nordgren, B., & Pink, S. (1999) · doi:10.17487/rfc2507 · Cited by 213
Improving round-trip time estimates in reliable transport protocols
Karn, P., & Partridge, C. (1991) · ACM Transactions on Computer Systems · doi:10.1145/118544.118549 · Cited by 179
Improving round-trip time estimates in reliable transport protocols
Karn, P., & Partridge, C. (1987) · doi:10.1145/55482.55484 · Cited by 83
Multi-layer tracing of TCP over a reliable wireless link
Ludwig, R., Rathonyi, B., Konrad, A., Oden, K., & Joseph, A. D. (1999) · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · doi:10.1145/301453.301488 · Cited by 75
Self-citationOptimizing the end-to-end performance of reliable flows over wireless links
Ludwig, R., Konrad, A., & Joseph, A. D. (1999) · ACM Annual International Conference on Mobile Computing and Networking (MobiCom) · doi:10.1145/313451.313513 · Cited by 62
Self-citationOptimizing the End-to-End Performance of Reliable Flows over Wireless Links
Ludwig, R., Konrad, A., Joseph, A. D., & Katz, R. H. (2002) · Wireless Networks · doi:10.1023/a:1013750211660 · Cited by 40
Self-citation
Cited by
Concurrent Multipath Transfer Using SCTP Multihoming Over Independent End-to-End Paths
Iyengar, J. R., Amer, P. D., & Stewart, R. (2006) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2006.882843 · Cited by 652
Dynamic load balancing without packet reordering
Kandula, S., Katabi, D., Sinha, S., & Berger, A. (2007) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1232919.1232925 · Cited by 402
TCP performance issues over wireless links
Xylomenos, G., Polyzos, G. C., Mahonen, P., & Saaranen, M. (2001) · IEEE Communications Magazine · doi:10.1109/35.917504 · Cited by 308
Host-to-Host Congestion Control for TCP
Afanasyev, A., Tilley, N., Reiher, P., & Kleinrock, L. (2010) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2010.042710.00114 · Cited by 278
On making TCP more robust to packet reordering
Blanton, E., & Allman, M. (2002) · ACM SIGCOMM Computer Communication Review · doi:10.1145/510726.510728 · Cited by 257
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
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.