The DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.
TCP ex machina: computer-generated congestion control
Abstract
This paper describes a new approach to end-to-end congestion control on a multi-user network. Rather than manually formulate each endpoint's reaction to congestion signals, as in traditional protocols, we developed a program called Remy that generates congestion-control algorithms to run at the endpoints.
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
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
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
Congestion avoidance and control
Jacobson, V. (1988) · Symposium proceedings on Communications architectures and protocols · doi:10.1145/52324.52356 · Cited by 2,479
CUBIC: a new TCP-friendly high-speed TCP variant
Ha, S., Rhee, I., & Xu, L. (2008) · ACM SIGOPS Operating Systems Review · doi:10.1145/1400097.1400105 · Cited by 2,287
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
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
Equation-based congestion control for unicast applications
Floyd, S., Handley, M., Padhye, J., & Widmer, J. (2000) · ACM SIGCOMM Computer Communication Review · doi:10.1145/347057.347397 · Cited by 1,414
Geometric modeling using octree encoding
Meagher, D. (1982) · Computer Graphics and Image Processing · doi:10.1016/0146-664x(82)90104-6 · Cited by 1,266
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
The Complexity of Decentralized Control of Markov Decision Processes
Bernstein, D. S., Givan, R., Immerman, N., & Zilberstein, S. (2002) · Mathematics of Operations Research · doi:10.1287/moor.27.4.819.297 · Cited by 1,192
Congestion 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
TCP and explicit congestion notification
Floyd, S. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205511.205512 · Cited by 1,016
Binary increase congestion control (BIC) for fast long-distance networks
Xu, L., Harfoush, K., & Rhee, I. (2005) · IEEE INFOCOM 2004 · doi:10.1109/infcom.2004.1354672 · Cited by 959
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
TCP westwood: Bandwidth estimation for enhanced transport over wireless links
Mascolo, S., Casetti, C., Gerla, M., Sanadidi, M. Y., & Wang, R. (2001) · Proceedings of the 7th annual international conference on Mobile computing and networking · doi:10.1145/381677.381704 · Cited by 921
The Mathematics of Internet Congestion Control
(2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.841398 · Cited by 821
TCP Vegas: new techniques for congestion detection and avoidance
Brakmo, L. S., O'Malley, S. W., & Peterson, L. L. (1994) · Proceedings of the conference on Communications architectures, protocols and applications - SIGCOMM '94 · doi:10.1145/190314.190317 · Cited by 698
The design philosophy of the DARPA internet protocols
Clark, D. (1988) · Symposium proceedings on Communications architectures and protocols · doi:10.1145/52324.52336 · Cited by 655
Nichols, K., & Jacobson, V. (2012) · Communications of the ACM · doi:10.1145/2209249.2209264 · Cited by 617
A Compound TCP Approach for High-Speed and Long Distance Networks
Tan, K., Song, J., Zhang, Q., & Sridharan, M. (2006) · Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications · doi:10.1109/infocom.2006.188 · Cited by 584
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 · cited 1×
“End-to-end control may be improved with explicit router participation, as in Explicit Congestion Notification (ECN) [15], VCP [44], active queue management schemes like RED [17], BLUE [14], CHOKe [35], AVQ [27], and CoDel [33] fair queueing, and explicit methods such as XCP [24] and RCP [38].”
MethodAlizadeh, 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
Analysis and design of an adaptive virtual queue (AVQ) algorithm for active queue management
Kunniyur, S., & Srikant, R. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383069 · Cited by 490
Improving the start-up behavior of a congestion control scheme for TCP
Hoe, J. C. (1996) · Conference proceedings on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/248156.248180 · Cited by 461
Metamagical Themas: Questing for the Essence of Mind and Pattern
Taylor, C., & Hofstadter, D. R. (1985) · The Antioch Review · doi:10.2307/4611504 · Cited by 432
An Axiomatic Theory of Fairness in Network Resource Allocation
Lan, T., Kao, D., Chiang, M., & Sabharwal, A. (2010) · 2010 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2010.5461911 · Cited by 418
CHOKe - a stateless active queue management scheme for approximating fair bandwidth allocation
Pan, R., Prabhakar, B., & Psounis, K. (2002) · Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064) · doi:10.1109/infcom.2000.832269 · Cited by 416
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
Binomial congestion control algorithms
Bansal, D., & Balakrishnan, H. (2002) · Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213) · doi:10.1109/infcom.2001.916251 · Cited by 363
Self-citationAn integrated congestion management architecture for Internet hosts
Balakrishnan, H., Rahul, H. S., & Seshan, S. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316220 · Cited by 341
Self-citationA delay-based approach for congestion avoidance in interconnected heterogeneous computer networks
Jain, R. (1989) · ACM SIGCOMM Computer Communication Review · doi:10.1145/74681.74686 · Cited by 319
McKenney, P. E. (2002) · Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration · doi:10.1109/infcom.1990.91316 · Cited by 273
An argument for increasing TCP's initial congestion window
Dukkipati, N., Refice, T., Cheng, Y., Chu, J., Herbert, T., Agarwal, A., Jain, A. K., & Sutin, N. (2010) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1823844.1823848 · Cited by 256
Designing DCCP: congestion control without reliability
Kohler, E., Handley, M., & Floyd, S. (2006) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1151659.1159918 · Cited by 223
Controlling Queue Delay: A modern AQM is just one piece of the solution to bufferbloat.
Nichols, K., & Jacobson, V. (2012) · Queue · doi:10.1145/2208917.2209336 · Cited by 210
Improving the start-up behavior of a congestion control scheme for TCP
Hoe, J. C. (1996) · ACM SIGCOMM Computer Communication Review · doi:10.1145/248157.248180 · Cited by 202
Selfish behavior and stability of the internet: a game-theoretic analysis of TCP
Akella, A., Seshan, S., Karp, R. M., Shenker, S. J., & Papadimitriou, C. H. (2002) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/633025.633037 · Cited by 162
Increasing TCP's Initial Window
Chu, J., Dukkipati, N., Cheng, Y., & Mathis, M. (2013) · doi:10.17487/rfc6928 · Cited by 159
A new congestion control scheme: slow start and search (Tri-S)
Wang, Z., & Crowcroft, J. (1991) · ACM SIGCOMM Computer Communication Review · doi:10.1145/116030.116033 · Cited by 143
Metamagical themas: questing for the essence of mind and pattern
Hofstadter, D. R. (1985) · CERN Document Server (European Organization for Nuclear Research) · Cited by 113
Oliehoek, F. A. (2012) · Adaptation, learning, and optimization · doi:10.1007/978-3-642-27645-3_15 · Cited by 96
Xia, Y. Q., Subramanian, L., Stoica, I. G., & Kalyanaraman, S. (2008) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2007.912037 · Cited by 90
Allman, M. C. (2012) · ACM SIGCOMM Computer Communication Review · doi:10.1145/2427036.2427041 · Cited by 82
Advice for Internet Subnetwork Designers
Bormann, C., Fairhurst, G., Grossman, D., Ludwig, R., Mahdavi, J., Montenegro, G., Touch, J. D., & Wood, L. (2004) · doi:10.17487/rfc3819 · Cited by 58
An Axiomatic Theory of Fairness
Lan, T., Kao, D., Chiang, M., & Sabharwal, A. (2009) · Cited by 23
Cited by
Applications of Deep Reinforcement Learning in Communications and Networking: A Survey
Luong, N. C., Hoang, D. T., Gong, S., Niyato, D., Wang, P., Liang, Y.-C., & Kim, D. I. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2916583 · Cited by 2,060
Resource Management with Deep Reinforcement Learning
Mao, H., Alizadeh, M., Menache, I., & Kandula, S. (2016) · Proceedings of the 15th ACM Workshop on Hot Topics in Networks · doi:10.1145/3005745.3005750 · Cited by 1,353
Boutaba, R., Salahuddin, M. A., Limam, N., Ayoubi, S., Shahriar, N., Estrada-Solano, F., & Caicedo, O. M. (2018) · Journal of Internet Services and Applications · doi:10.1186/s13174-018-0087-2 · Cited by 1,036
Certified Defenses against Adversarial Examples
Raghunathan, A., Steinhardt, J., & Liang, P. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1801.09344 · Cited by 520
Machine Learning for Networking: Workflow, Advances and Opportunities
Wang, M., Cui, Y., Wang, X., Xiao, S., & Jiang, J. (2018) · IEEE Network · doi:10.1109/mnet.2017.1700200 · Cited by 448
Metadata
- Authors
- Winstein, K., & Balakrishnan, H.
- Venue
- Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
- Publisher
- ACM
- Published
- 2013-08-27
- Pages
- 123-134
- OpenAlex
- W1988975763
- Cited by
- 332
- References
- 46
- FWCI
- 16.67
- 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.