The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Automatic TCP buffer tuning
Open accessAbstract
With the growth of high performance networking, a single host may have simultaneous connections that vary in bandwidth by as many as six orders of magnitude. We identify requirements for an automatically-tuning TCP to achieve maximum throughput across all connections simultaneously within the resource limits of the sender. Our auto-tuning TCP implementation makes use of several existing technologies and adds dynamically adjusting socket buffers to achieve maximum transfer rates on each connection without manual configuration.Our implementation involved slight modifications to a BSD-based socket interface and TCP stack. With these modifications, we achieved drastic improvements in performance over large bandwidth delay paths compared to the default system configuration, and significant reductions in memory usage compared to hand-tuned connections, allowing servers to support at least twice as many simultaneous connections.
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.
Integrity signals
Registry
Cites
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.
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
Congestion avoidance and control
Jacobson, V. (1988) · Symposium proceedings on Communications architectures and protocols · doi:10.1145/52324.52356 · Cited by 2,479
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
Self-citationSimulation-based comparisons of Tahoe, Reno and SACK TCP
Fall, K., & Floyd, S. (1996) · ACM SIGCOMM Computer Communication Review · doi:10.1145/235160.235162 · Cited by 1,148
TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms
Stevens, W. (1997) · doi:10.17487/rfc2001 · Cited by 1,143
TCP Extensions for High Performance
Borman, D., Braden, B., & Jacobson, V. (2014) · doi:10.17487/rfc7323 · Cited by 1,010
High performance TCP in ANSNET
Villamizar, C., & Song, C. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205511.205520 · Cited by 362
Forward acknowledgement: refining TCP congestion control
Mathis, M., & Mahdavi, J. (1996) · Conference proceedings on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/248156.248181 · Cited by 228
Self-citation
Cited by
Binary increase congestion control (BIC) for fast long-distance networks
Xu, L., Harfoush, K., & Rhee, I. (2005) · IEEE INFOCOM 2004 · doi:10.1109/infcom.2004.1354672 · Cited by 959
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
- Semke, J., Mahdavi, J., & Mathis, M.
- Venue
- Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
- Publisher
- ACM
- Published
- 1998-10
- Pages
- 315-323
- OpenAlex
- W2060112420
- Cited by
- 253
- References
- 8
- FWCI
- 9.02
- Type
- conference paper
- 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: Automatic TCP buffer tuning. https://app.cochat.ai/papers/10.1145/285237.285292
- The paper
- Semke, J., Mahdavi, J., & Mathis, M. (1998). Automatic TCP buffer tuning. Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication. https://doi.org/10.1145/285237.285292
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.