The DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.
Classic Meets Modern: a Pragmatic Learning-Based Congestion Control for the Internet
Abstract
These days, taking the revolutionary approach of using clean-slate learning-based designs to completely replace the classic congestion control schemes for the Internet is gaining popularity. However, we argue that current clean-slate learning-based techniques bring practical issues and concerns such as overhead, convergence issues, and low performance over unseen network conditions to the table. To address these issues, we take a pragmatic and evolutionary approach combining classic congestion control strategies and advanced modern deep reinforcement learning (DRL) techniques and introduce a novel hybrid congestion control for the Internet named Orca1. Through extensive experiments done over global testbeds on the Internet and various locally emulated network conditions, we demonstrate that Orca is adaptive and achieves consistent high performance in different network conditions, while it can significantly alleviate the issues and problems of its clean-slate learning-based counterparts.
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
Hochreiter, S., & Schmidhuber, J. (1997) · Neural Computation · doi:10.1162/neco.1997.9.8.1735 · Cited by 102,318
Human-level control through deep reinforcement learning
Mnih, V., Kavukcuoglu, K., Silver, D., Rusu, A. A., Veness, J., Bellemare, M. G., Graves, A., Riedmiller, M., Fidjeland, A. K., Ostrovski, G., et al. (2015) · Nature · doi:10.1038/nature14236 · Cited by 30,357
Reinforcement Learning: An Introduction
Sutton, R. S., & Barto, A. G. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.1998.712192 · Cited by 27,225
Mastering the game of Go with deep neural networks and tree search
Silver, D., Huang, A., Maddison, C. J., Guez, A., Sifre, L., van den Driessche, G., Schrittwieser, J., Antonoglou, I., Panneershelvam, V., Lanctot, M., et al. (2016) · Nature · doi:10.1038/nature16961 · Cited by 15,612
Continuous control with deep reinforcement learning
Lillicrap, T. P., Hunt, J. J., Pritzel, A., Heess, N., Erez, T., Tassa, Y., Silver, D., & Wierstra, D. (2015) · arXiv · doi:10.48550/arxiv.1509.02971 · Cited by 10,782
Playing Atari with Deep Reinforcement Learning
Mnih, V., Kavukcuoglu, K., Silver, D., Graves, A., Antonoglou, I., Wierstra, D., & Riedmiller, M. (2013) · arXiv · doi:10.48550/arxiv.1312.5602 · Cited by 9,471
Overcoming catastrophic forgetting in neural networks
Kirkpatrick, J., Pascanu, R., Rabinowitz, N., Veness, J., Desjardins, G., Rusu, A. A., Milan, K., Quan, J., Ramalho, T., Grabska-Barwinska, A., et al. (2017) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1611835114 · Cited by 7,899
McClelland, J. L., McNaughton, B. L., & O'Reilly, R. C. (1995) · Psychological Review · doi:10.1037/0033-295x.102.3.419 · Cited by 5,256
Addressing Function Approximation Error in Actor-Critic Methods
Fujimoto, S., van Hoof, H., & Meger, D. (2018) · arXiv · doi:10.48550/arxiv.1802.09477 · Cited by 3,650
Deterministic Policy Gradient Algorithms
Silver, D., Lever, G., Heess, N., Degris, T., Wierstra, D., & Riedmiller, M. (2014) · HAL · Cited by 3,275
The Psychology of Learning and Motivation
Ross, B. H. (2012) · Cited by 2,633
Congestion avoidance and control
Jacobson, V. (1988) · Symposium proceedings on Communications architectures and protocols · doi:10.1145/52324.52356 · Cited by 2,479
Catastrophic forgetting in connectionist networks
French, R. (1999) · Trends in Cognitive Sciences · doi:10.1016/s1364-6613(99)01294-2 · Cited by 2,311
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
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
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
BBR: congestion-based congestion control
Cardwell, N., Cheng, Y., Gunn, C. S., Yeganeh, S. H., & Jacobson, V. L. (2017) · Communications of the ACM · doi:10.1145/3009824 · Cited by 1,028
Ratcliff, R. (1990) · Psychological Review · doi:10.1037//0033-295x.97.2.285 · Cited by 941
Deep Reinforcement Learning: An Overview
Li, Y. (2017) · arXiv · doi:10.48550/arxiv.1701.07274 · Cited by 762
(2005) · Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. · doi:10.1109/infcom.2005.1498425 · Cited by 677
Nichols, K., & Jacobson, V. (2012) · Communications of the ACM · doi:10.1145/2209249.2209264 · Cited by 617
Learning and Generalization in Overparameterized Neural Networks, Going Beyond Two LayersPreprint
Allen-Zhu, Z., Li, Y., & Liang, Y. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1811.04918 · Cited by 587
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
Gradient calculations for dynamic recurrent neural networks: a survey
Pearlmutter, B. A. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.410363 · Cited by 582
GENI: A federated testbed for innovative network experiments
Berman, M., Chase, J. S., Landweber, L., Nakao, A., Ott, M., Raychaudhuri, D., Ricci, R., & Seskar, I. (2014) · Computer Networks · doi:10.1016/j.bjp.2013.12.037 · Cited by 571
TIMELY: RTT-based Congestion Control for the Datacenter
Mittal, R., Lam, V. T., Dukkipati, N., Blem, E., Wassel, H. M. G., Ghobadi, M., Vahdat, A. M., Wang, Y., Wetherall, D. J., & Zats, D. (2015) · ACM SIGCOMM Computer Communication Review · doi:10.1145/2829988.2787510 · Cited by 439
Stochastic forecasts achieve high throughput and low delay over cellular networks
Winstein, K., Sivaraman, A., & Balakrishnan, H. (2013) · Networked Systems Design and Implementation · Cited by 422
Design and implementation of a routing control platform
Caesar, M., Caldwell, D., & Shaikh, A. (2005) · Cited by 395
Learning to Adapt in Dynamic, Real-World Environments through Meta-Reinforcement Learning
Nagabandi, A., Clavera, I., Liu, S., Fearing, R. S., Abbeel, P., Levine, S., & Finn, C. (2018) · arXiv · doi:10.48550/arxiv.1803.11347 · Cited by 370
PIE: A lightweight control scheme to address the bufferbloat problem
Pan, R., Natarajan, P., Piglione, C., Prabhu, M. S., Subramanian, V., Baker, F., & VerSteeg, B. (2013) · IEEE International Conference on High Performance Switching and Routing (HPSR) · doi:10.1109/hpsr.2013.6602305 · Cited by 360
Copa: Practical Delay-Based Congestion Control for the Internet
Arun, V., & Balakrishnan, H. (2018) · Proceedings of the Applied Networking Research Workshop · doi:10.1145/3232755.3232783 · Cited by 333
TCP ex machina: computer-generated congestion control
Winstein, K., & Balakrishnan, H. (2013) · Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM · doi:10.1145/2486001.2486020 · Cited by 332
Successor Features for Transfer in Reinforcement Learning
Barreto, A. D. M. S., Dabney, W., Munos, R., Hunt, J. J., Schaul, T., Silver, D., & van Hasselt, H. P. (2016) · arXiv (Cornell University) · doi:10.13140/rg.2.2.35439.18085 · Cited by 305
TCP-Illinois: A loss- and delay-based congestion control algorithm for high-speed networks
Liu, S., Başar, T., & Srikant, R. (2008) · Performance Evaluation · doi:10.1016/j.peva.2007.12.007 · Cited by 259
Rethinking end-to-end congestion control in software-defined networks
Ghobadi, M., Yeganeh, S. H., & Ganjali, Y. (2012) · ACM Workshop on Hot Topics in Networks (HotNets) · doi:10.1145/2390231.2390242 · Cited by 102
Equilibrium of Heterogeneous Congestion Control: Existence and Uniqueness
Tang, A., Wang, J., Low, S. H., & Chiang, M. (2007) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2007.893885 · Cited by 81
C2TCP: A Flexible Cellular TCP to Meet Stringent Delay Requirements
Abbasloo, S., Xu, Y., & Chao, H. J. (2019) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2019.2898758 · Cited by 65
Self-citationPark, S., Lee, J., Kim, J., Lee, J., Ha, S., & Lee, K. (2018) · ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT) · doi:10.1145/3281411.3281430 · Cited by 55
Generalizing Skills with Semi-Supervised Reinforcement LearningPreprint
Finn, C., Yu, T., Fu, J., Abbeel, P., & Levine, S. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1612.00429 · Cited by 50
Mahimahi: a lightweight toolkit for reproducible web measurement
Netravali, R., Sivaraman, A., Winstein, K., Das, S. R., Goyal, A., & Balakrishnan, H. (2014) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/2619239.2631455 · Cited by 48
2019 IFIP Networking Conference (IFIP Networking)
(2019) · doi:10.23919/ifipnetworking46909.2019 · Cited by 23
Cellular Controlled Delay TCP (C2TCP)
Abbasloo, S., Li, T., Xu, Y., & Chao, H. J. (2018) · IFIP Networking Conference (IFIP Networking) · doi:10.23919/ifipnetworking.2018.8696844 · Cited by 16
Self-citation
Cited by
NetLLM: adapting large language models for networking
Wu, D., Wang, X., Qiao, Y., Wang, Z., Jiang, J., Cui, S., & Wang, F. (2024) · Proceedings of the ACM SIGCOMM 2024 Conference · doi:10.1145/3651890.3672268 · Cited by 167
“…studies have showcased that LLMs are capable of generating some technical documents for networking (e.g., description documents of digital twin for data centers [51]), none of the existing works provide an in-depth investigation on whether and how LLMs can be adapted to solve networking tasks.”
Background
Metadata
- Authors
- Abbasloo, S., Yen, C.-Y., & Chao, H. J.
- Venue
- Proceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication
- Publisher
- ACM
- Published
- 2020-07-30
- Pages
- 632-647
- OpenAlex
- W3046478992
- Cited by
- 255
- References
- 44
- FWCI
- 25.84
- 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.