The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
A binary feedback scheme for congestion avoidance in computer networks with a connectionless network layer
Abstract
We propose a scheme for congestion avoidance in networks using a connectionless protocol at the network layer. The scheme uses feedback from the network to the users of the network. The interesting challenge for the scheme is to use a minimal amount of feedback (one bit in each packet) from the network to adjust the amount of traffic allowed into the network. The servers in the network detect congestion and set a congestion indication bit on packets flowing in the forward direction. The congestion indication is communicated back to the users through the transport level acknowledgement. The scheme is distributed, adapts to the dynamic state of the network, converges to the optimal operating point, is quite simple to implement, and has low overhead while operational. The scheme also addresses a very important aspect of fairness in the service provided to the various sources utilizing the network. The scheme attempts to maintain fairness in service provided to multiple sources. This paper presents the scheme and the analysis that went into the choice of the various decision mechanisms. We also address the performance of the scheme under transient changes in the network and for pathological conditions.
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
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
Proceedings of the IEEE International Conference on Communications
McLaughlin, S., Mulgrew, B., & Cowan, C. F. N. (1989) · Cited by 787
Congestion control in IP/TCP internetworks
Nagle, J. (1984) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1024908.1024910 · Cited by 426
Jain, R. K., & Ramakrishnan, K. K. (2003) · Computer Networking Symposium · doi:10.1109/cns.1988.4990 · Cited by 152
Self-citation
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
Optimization flow control. I. Basic algorithm and convergence
Low, S. H., & Lapsely, D. E. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.811451 · Cited by 1,972
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Chiu, D.-M., & Jain, R. (1989) · Computer Networks and ISDN Systems · doi:10.1016/0169-7552(89)90019-6 · Cited by 1,902
Self-citationThe performance of TCP/IP for networks with high bandwidth-delay products and random loss
Lakshman, T. V., & Madhow, U. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.611099 · Cited by 928
Analysis of TCP performance over mobile ad hoc networks
Holland, G., & Vaidya, N. (1999) · Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/313451.313540 · Cited by 706
Metadata
- Authors
- Ramakrishnan, K. K., & Jain, R.
- Venue
- ACM SIGCOMM Computer Communication Review
- Published
- 1995-01-11
- Volume
- 25
- Issue
- 1
- Pages
- 138-156
- ISSN
- 0146-4833 (ISSN-L)
- OpenAlex
- W1986753211
- Cited by
- 255
- References
- 4
- FWCI
- 18.69
- 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.