The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
A binary feedback scheme for congestion avoidance in computer networks
Open accessAbstract
We propose a scheme for congestion avoidance in networks using a connectionless protocol at the network layer. The scheme uses a minimal amount of feedback from the network to the users, who adjust the amount of traffic allowed into the network. The routers 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 acknowledgment. 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. The scheme maintains 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 pathological overload 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
International Organization for Standardization
(2011) · SpringerReference · doi:10.1007/springerreference_16847 · Cited by 12,534
(2011) · SpringerReference · doi:10.1007/springerreference_27387 · Cited by 3,053
Congestion control in IP/TCP internetworks
Nagle, J. (1984) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1024908.1024910 · Cited by 426
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
Alizadeh, M., Greenberg, A., Maltz, D. A., Padhye, J., Patel, P., Prabhakar, B., Sengupta, S., & Sridharan, M. (2010) · Proceedings of the ACM SIGCOMM 2010 conference · doi:10.1145/1851182.1851192 · Cited by 1,877
TCP and explicit congestion notification
Floyd, S. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205511.205512 · Cited by 1,016
High-speed switch scheduling for local-area networks
Anderson, T. E., Owicki, S. S., Saxe, J. B., & Thacker, C. P. (1993) · ACM Transactions on Computer Systems · doi:10.1145/161541.161736 · Cited by 892
A control-theoretic approach to flow control
Keshav, S. (1991) · Proceedings of the conference on Communications architecture & protocols · doi:10.1145/115992.115995 · Cited by 752
The BLUE active queue management algorithms
Feng, W.-C., Shin, K. G., Kandlur, D. D., & Saha, D. (2002) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.801399 · Cited by 576
Measurements and analysis of end-to-end Internet dynamics
Paxson, V. (1997) · doi:10.2172/551971 · Cited by 572
Alizadeh, M., Greenberg, A., Maltz, D. A., Padhye, J., Patel, P., Prabhakar, B., Sengupta, S., & Sridharan, M. (2010) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1851275.1851192 · Cited by 548
Resource pricing and the evolution of congestion control
Gibbens, R. J., & Kelly, F. P. (1999) · Automatica · doi:10.1016/s0005-1098(99)00135-1 · Cited by 544
A self-configuring RED gateway
Feng, W.-C., Kandlur, D. D., Saha, D., & Shin, K. G. (1999) · IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320) · doi:10.1109/infcom.1999.752150 · Cited by 510
Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic
Floyd, S. (1991) · ACM SIGCOMM Computer Communication Review · doi:10.1145/122431.122434 · Cited by 382
Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic
Zhang, L., Shenker, S., & Clark, D. D. (1991) · Proceedings of the conference on Communications architecture & protocols · doi:10.1145/115992.116006 · Cited by 375
Traffic phase effects in packet-switched gateways
Floyd, S., & Jacobson, V. (1991) · ACM SIGCOMM Computer Communication Review · doi:10.1145/122419.122421 · Cited by 335
TCP ex machina: computer-generated congestion control
Winstein, K., & Balakrishnan, H. (2013) · Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM · doi:10.1145/2486001.2486020 · Cited by 332
AutoMAP: Diagnose Your Microservice-based Web Applications Automatically
Ma, M., Xu, J., Wang, Y., Chen, P., Zhang, Z., & Wang, P. (2020) · Proceedings of The Web Conference 2020 · doi:10.1145/3366423.3380111 · Cited by 129
MS-Rank: Multi-Metric and Self-Adaptive Root Cause Diagnosis for Microservice Applications
Ma, M., Lin, W., Pan, D., & Wang, P. (2019) · 2019 IEEE International Conference on Web Services (ICWS) · doi:10.1109/icws.2019.00022 · Cited by 58
Ajtai, M., Aspnes, J., Naor, M., Rabani, Y., Schulman, L. J., & Waarts, O. (1998) · Journal of Algorithms · doi:10.1006/jagm.1998.0953 · Cited by 47
ServiceRank: Root Cause Identification of Anomaly in Large-Scale Microservice Architectures
Ma, M., Lin, W., Pan, D., & Wang, P. (2022) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2021.3083671 · Cited by 46
Self-Adaptive Root Cause Diagnosis for Large-Scale Microservice Architecture
Ma, M., Lin, W., Pan, D., & Wang, P. (2022) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2020.2993251 · Cited by 37
Metadata
- Authors
- Ramakrishnan, K. K., & Jain, R.
- Venue
- ACM Transactions on Computer Systems
- Published
- 1990-05
- Volume
- 8
- Issue
- 2
- Pages
- 158-181
- ISSN
- 0734-2071 (ISSN-L)
- 1557-7333
- OpenAlex
- W2096597645
- Cited by
- 365
- References
- 3
- FWCI
- 12.50
- 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.