The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
A control-theoretic approach to flow control
Open accessAbstract
This paper presents a control-theoretic approach to reactive flow control in networks that do not reserve bandwidth.We assume a round-robin-like queue service discipline in the output queues of the network's switches, and propose deterministic and stochastic models for a single conversation in a network of such switches.These models motivate the Packet-Pair rate probing technique, and a provably stable rate-based flow control scheme.A Kalman state estimator is derived from d~crete-time state space analysis, but there are difficulties in using the estimator in practice.These difficulties are overcome by a novel estimation scheme based on fuzzy logic.We then present a technique to extract and use additional information horn the system to develop a continuous-time system model.This is used to design a wuisnt of the control law that is also provably stable, and, in addition, takes control action as rapidly as possible.Finally, practical issues such as correcting parameter drift and cmmlination with window flow control are described.
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
Zadeh, L. A. (1965) · Information and Control · doi:10.1016/s0019-9958(65)90241-x · Cited by 67,855
Outline of a New Approach to the Analysis of Complex Systems and Decision Processes
Zadeh, L. A. (1973) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1973.5408575 · Cited by 8,721
Congestion avoidance and control
Jacobson, V. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205462 · Cited by 5,301
Adaptive filtering, prediction and control
Ioannou, P. (1985) · Automatica · doi:10.1016/0005-1098(85)90014-7 · Cited by 4,480
Adaptive filtering prediction and control
Goodwin, G. C., & Sin, K. S. (1984) · Cited by 3,400
Anderson, B. D. O., Moore, J. B., & Eslami, M. (1982) · IEEE Transactions on Systems Man and Cybernetics · Cited by 3,195
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
Self-citationCongestion avoidance and control
Jacobson, V. (1988) · Symposium proceedings on Communications architectures and protocols · doi:10.1145/52324.52356 · Cited by 2,479
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
Self-citation(2005) · Nonconvex Optimization and Its Applications · doi:10.1007/0-387-28154-1_8 · Cited by 1,550
A scheme for real-time channel establishment in wide-area networks
Ferrari, D., & Verma, D. C. (1990) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.53013 · Cited by 1,029
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
A binary feedback scheme for congestion avoidance in computer networks
Ramakrishnan, K. K., & Jain, R. (1990) · ACM Transactions on Computer Systems · doi:10.1145/78952.78955 · Cited by 365
A new architecture for packet switching network protocols
Zhang, L. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 152
Congestion control in computer networks
Keshav, S. (1991) · UC Berkeley · Cited by 124
Self-citationDynamic adaptive windows for high speed data networks: theory and simulations
Mitra, D., & Seery, J. B. (1990) · doi:10.1145/99508.99527 · Cited by 90
Myths about Congestion Management in High Speed NetworksPreprint
Jain, R. K. (1998) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/9809088 · Cited by 69
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
Routing in multi-radio, multi-hop wireless mesh networks
Draves, R., Padhye, J., & Zill, B. (2004) · Proceedings of the 10th annual international conference on Mobile computing and networking · doi:10.1145/1023720.1023732 · Cited by 2,456
TCP Vegas: end to end congestion avoidance on a global Internet
Brakmo, L. S., & Peterson, L. L. (1995) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.464716 · Cited by 1,699
TCP Vegas: new techniques for congestion detection and avoidance
Brakmo, L. S., O'Malley, S. W., & Peterson, L. L. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/190809.190317 · Cited by 1,198
End-to-end Internet packet dynamics
Paxson, V. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.779192 · Cited by 908
Metadata
- Authors
- Keshav, S.
- Venue
- Proceedings of the conference on Communications architecture & protocols
- Publisher
- ACM
- Published
- 1991-08
- Pages
- 3-15
- OpenAlex
- W2098289156
- Cited by
- 752
- References
- 17
- FWCI
- 10.32
- Type
- conference paper
- Language
- en
- Open access
- gold
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.