The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Congestion avoidance and control
Abstract
Computer networks have experienced an explosive growth over the past few years and with that growth have come severe congestion problems. For example, it is now common to see internet gateways drop 10 % of the incoming packets because of local buffer overflows. Our investigation of some of these problems has shown that much of the cause lies in
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
Theory and Practice of Recursive Identification
Lennart Ljung, A., & Söderström, T. (1983) · Lund University Publications (Lund University) · Cited by 3,989
ISO (International Organization for Standardization)
Nollet, L. M. L. (2019) · Testing and Analysis of GMO-containing Foods and Feed · doi:10.1201/9781315178592-10 · Cited by 1,895
Introduction to dynamic systems
(2016) · Structural Dynamics · doi:10.1201/9781315375311-5 · Cited by 567
Congestion control in IP/TCP internetworks
Nagle, J. (1984) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1024908.1024910 · Cited by 426
Improving round-trip time estimates in reliable transport protocols
Karn, P., & Partridge, C. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205455 · Cited by 323
Congestion Control in IP/TCP Internetworks
Nagle, J. (1984) · doi:10.17487/rfc0896 · Cited by 198
Congestion Avoidance in Computer Networks with a Connectionless Network Layer
Jain, R. K., Ramakrishnan, K. K., & Chiu, D. M. (1998) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/9809094 · Cited by 164
Improving round-trip time estimates in reliable transport protocols
Karn, P., & Partridge, C. (1987) · doi:10.1145/55482.55484 · Cited by 83
Transmission Control Protocol Specification.
Postel, J. B., Garlick, L. L., & Rom, R. (1976) · Defense Technical Information Center (DTIC) · Cited by 55
Something a Host Could Do with Source Quench: The Source Quench Introduced Delay (SQuID)
Prue, W., & Postel, J. B. (1987) · doi:10.17487/rfc1016 · Cited by 44
Supercomputers on the internet: a case study
Kline, C. (1987) · ACM Workshop on Frontiers in Computer Communications Technology · doi:10.1145/55482.55487 · Cited by 14
Cited by
Random early detection gateways for congestion avoidance
Floyd, S., & Jacobson, V. (1993) · IEEE/ACM Transactions on Networking · doi:10.1109/90.251892 · Cited by 6,290
“In addition, the emphasis on avoiding the global synchronization that results from many connections reducing their windows at the same time is particularly relevant in a network with 4.3-Tahoe BSD TCP [ 14 ], where each connection goes through Slow-Start, reducing the window to one, in response to a dropped packet.”
BackgroundInfluentialSelf-citationRate control for communication networks: shadow prices, proportional fairness and stability
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2600523 · Cited by 5,021
Jacobson, V., Smetters, D. K., Thornton, J. D., Plass, M. F., Briggs, N. H., & Braynard, R. L. (2009) · Proceedings of the 5th international conference on Emerging networking experiments and technologies · doi:10.1145/1658939.1658941 · Cited by 4,031
Self-citationAllman, M., Paxson, V., & Blanton, E. (2009) · doi:10.17487/rfc5681 · Cited by 2,523
Fair end-to-end window-based congestion control
Mo, J., & Walrand, J. (2000) · IEEE/ACM Transactions on Networking · doi:10.1109/90.879343 · Cited by 2,095
Metadata
- Authors
- Jacobson, V.
- Venue
- ACM SIGCOMM Computer Communication Review
- Published
- 1995-01-11
- Volume
- 25
- Issue
- 1
- Pages
- 157-187
- ISSN
- 0146-4833 (ISSN-L)
- OpenAlex
- W2753542457
- Cited by
- 5,301
- References
- 11
- FWCI
- 165.20
- Type
- journal article
- 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.