The DOI matches its Crossref record.
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
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
Dynamically forecasting network performance using the Network Weather Service
Wolski, R. (1998) · Cluster Computing · doi:10.1023/a:1019025230054 · Cited by 395
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
- 0
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A control-theoretic approach to flow control. https://app.cochat.ai/papers/10.1145/115992.115995
- The paper
- Keshav, S. (1991). A control-theoretic approach to flow control. Proceedings of the conference on Communications architecture & protocols. https://doi.org/10.1145/115992.115995
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.