The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Scalable laws for stable network congestion control
Abstract
Discusses flow control in networks, in which sources control their rates based on feedback signals received from the network links, a feature present in current TCP protocols. We develop a congestion control system which is arbitrarily scalable, in the sense that its stability is maintained for arbitrary network topologies and arbitrary amounts of delay. Such a system can be implemented in a decentralized way with information currently available in networks plus a small amount of additional signaling.
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
Congestion avoidance and control
Jacobson, V. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205462 · Cited by 5,301
Rate control for communication networks: shadow prices, proportional fairness and stability
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2600523 · Cited by 5,021
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
Self-citationTCP 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
Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED
Misra, V., Gong, W.-B., & Towsley, D. (2000) · ACM SIGCOMM Computer Communication Review · doi:10.1145/347057.347421 · Cited by 1,274
A control theoretic analysis of RED
Hollot, C. V., Misra, V., Towsley, D., & Gong, W. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2001.916647 · Cited by 923
(2002) · IEEE Control Systems · doi:10.1109/37.980245 · Cited by 796
End-to-end congestion control schemes: utility functions, random losses and ecn marks
Kunniyur, S., & Srikant, R. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.818183 · Cited by 448
Congestion control in high-speed communication networks using the Smith principle
Mascolo, S. (1999) · Automatica · doi:10.1016/s0005-1098(99)00128-4 · Cited by 237
Congestion control as a stochastic control problem with action delays
Altman, E., Başar, T., & Srikant, R. (1999) · Automatica · doi:10.1016/s0005-1098(99)00127-2 · Cited by 143
Cited by
Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
Olfati-Saber, R., & Murray, R. M. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.834113 · Cited by 12,788
Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures
Chiang, M., Low, S. H., Calderbank, A. R., & Doyle, J. C. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887322 · Cited by 1,352
Self-citationCongestion control for high bandwidth-delay product networks
Katabi, D., Handley, M., & Rohrs, C. (2002) · Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/633025.633035 · Cited by 1,096
FAST TCP: Motivation, Architecture, Algorithms, Performance
Wei, D. X., Jin, C., Low, S. H., & Hegde, S. (2006) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2006.886335 · Cited by 955
Self-citation(2002) · IEEE Control Systems · doi:10.1109/37.980245 · Cited by 796
Metadata
- Authors
- Paganini, F., Doyle, J., & Low, S.
- Venue
- Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228)
- Publisher
- IEEE
- Published
- 2003-07-10
- Volume
- 1
- Pages
- 185-190
- ISSN
- 0191-2216 (ISSN-L)
- OpenAlex
- W2142325999
- Cited by
- 276
- References
- 10
- FWCI
- 19.18
- Type
- conference paper
- 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.