The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Feedback control of congestion in packet switching networks: the case of a single congested node
Abstract
Addresses a rate-based feedback approach to congestion control in packet switching networks where sources adjust their transmission rate in response to feedback information from the network nodes. Specifically, a controller structure and system architecture are introduced and the analysis of the resulting closed loop system is presented. Conditions for asymptotic stability are derived. A design technique for the controller gains is developed and an illustrative example is considered. The results show that, under appropriately selected control gains, a stable (nonoscillatory) operation of store-and-forward packet switching networks with feedback congestion control is possible.>
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
Bertsekas, D. P., & Gallager, R. G. (1987) · Cited by 5,561
Congestion avoidance and control
Jacobson, V. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205462 · Cited by 5,301
Analysis and simulation of a fair queueing algorithm
Demers, A., Keshav, S., & Shenker, S. (1989) · ACM SIGCOMM Computer Communication Review · doi:10.1145/75247.75248 · Cited by 2,614
Congestion avoidance and control
Jacobson, V. (1988) · Symposium proceedings on Communications architectures and protocols · doi:10.1145/52324.52356 · Cited by 2,479
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
Analysis and simulation of a fair queueing algorithm
Demers, A., Keshav, S., & Shenker, S. (1989) · Symposium proceedings on Communications architectures & protocols · doi:10.1145/75246.75248 · Cited by 1,729
Telecommunication networks: protocols, modeling and analysis
Schwartz, M. (1986) · Addison-Wesley Longman Publishing Co., Inc. eBooks · Cited by 897
New directions in communications (or which way to the information age?)
Turner, J. (1986) · IEEE Communications Magazine · doi:10.1109/mcom.1986.1092946 · Cited by 850
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
Perdikaris, G. A. (1991) · Springer eBooks · doi:10.1007/978-94-015-7929-2 · Cited by 700
Cited by
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
(2002) · IEEE Control Systems · doi:10.1109/37.980245 · Cited by 796
A neural-fuzzy system for congestion control in ATM networks
Lee, S.-J., & Hou, C.-L. (2000) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.826942 · Cited by 45
Metadata
- Authors
- Benmohamed, L., & Meerkov, S. M.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 1993
- Volume
- 1
- Issue
- 6
- Pages
- 693-708
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2122745457
- Cited by
- 324
- References
- 19
- FWCI
- 7.44
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Feedback control of congestion in packet switching networks: the case of a single congested node. https://app.cochat.ai/papers/10.1109/90.266057
- The paper
- Benmohamed, L., & Meerkov, S. M. (1993). Feedback control of congestion in packet switching networks: the case of a single congested node. IEEE/ACM Transactions on Networking. https://doi.org/10.1109/90.266057
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.