The DOI matches its Crossref record.
Congestion Control in IP/TCP Internetworks
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
Cited by
Congestion avoidance and control
Jacobson, V. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205462 · Cited by 5,301
Wide area traffic: the failure of Poisson modeling
Paxson, V., & Floyd, S. (1995) · IEEE/ACM Transactions on Networking · doi:10.1109/90.392383 · Cited by 3,708
Congestion avoidance and control
Jacobson, V. (1988) · Symposium proceedings on Communications architectures and protocols · doi:10.1145/52324.52356 · Cited by 2,479
Promoting the use of end-to-end congestion control in the Internet
Floyd, S., & Fall, K. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.793002 · Cited by 1,646
Naiad: a timely dataflow system
Murray, D. G., McSherry, F., Isaacs, R., Isard, M., Barham, P., & Abadi, M. (2013) · Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles · doi:10.1145/2517349.2522738 · Cited by 656
Nichols, K., & Jacobson, V. (2012) · Communications of the ACM · doi:10.1145/2209249.2209264 · Cited by 617
High performance TCP in ANSNET
Villamizar, C., & Song, C. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205511.205520 · Cited by 362
On the characteristics and origins of internet flow rates
Zhang, Y., Breslau, L., Paxson, V., & Shenker, S. (2002) · Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/633025.633055 · Cited by 325
Understanding the performance of TCP pacing
Aggarwal, A., Savage, S., & Anderson, T. (2002) · Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064) · doi:10.1109/infcom.2000.832483 · Cited by 302
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
Analysis of Decentralized AIMD-based EV Charging Control
Ucer, E., Kisacikoglu, M. C., & Yuksel, M. (2019) · 2019 IEEE Power & Energy Society General Meeting (PESGM) · doi:10.1109/pesgm40551.2019.8973725 · Cited by 14
Decentralized Additive Increase and Multiplicative Decrease-Based Electric Vehicle Charging
Ucer, E., Kisacikoglu, M. C., & Yuksel, M. (2021) · IEEE Systems Journal · doi:10.1109/jsyst.2020.3013189 · Cited by 11
Metadata
- Authors
- Nagle, J.
- Publisher
- RFC Editor
- Published
- 1984-01
- OpenAlex
- W4213240951
- Cited by
- 198
- References
- 0
- Type
- report
- Language
- en
- Open access
- closed
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.