The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Copa: Practical Delay-Based Congestion Control for the Internet
Abstract
Congestion control schemes that are commonly deployed today are loss-based and were developed in the 2000s. The internet has changed dramatically since then, and these schemes are no longer suitable. This has prompted new research interest in this area, ranging from complex machine learning and optimization techniques [1, 2, 3, 4] to exploring usage of hitherto under-explored ack-arrival rate as signals [5, 6, 7]. It has long been recognized that delay-based congestion control overcomes many challenges that loss-based schemes face [8, 9]. However they have challenges of their own that have precluded their deployment. In this work, we identify and solve some of these challenges to create Copa, a practical delay-based congestion control algorithm for the Internet.
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
Wide area traffic: the failure of Poisson modeling
Paxson, V., & Floyd, S. (1995) · IEEE/ACM Transactions on Networking · doi:10.1109/90.392383 · Cited by 3,708
Congestion avoidance and control
Jacobson, V. (1988) · ACM SIGCOMM Computer Communication Review · doi:10.1145/52325.52356 · Cited by 1,955
The macroscopic behavior of the TCP congestion avoidance algorithm
Mathis, M., Semke, J., Mahdavi, J., & Ott, T. (1997) · ACM SIGCOMM Computer Communication Review · doi:10.1145/263932.264023 · Cited by 1,495
FAST TCP: motivation, architecture, algorithms, performance
Jin, C., Wei, D. X., & Low, S. H. (2005) · IEEE INFOCOM 2004 · doi:10.1109/infcom.2004.1354670 · Cited by 625
Nichols, K., & Jacobson, V. (2012) · Communications of the ACM · doi:10.1145/2209249.2209264 · Cited by 617
Probe and Adapt: Rate Adaptation for HTTP Video Streaming At Scale
Li, Z., Zhu, X., Gahm, J., Pan, R., Hu, H., Begen, A. C., & Oran, D. (2014) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2014.140405 · Cited by 613
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
Less is more: trading a little bandwidth for ultra-low latency in the data center
Alizadeh, M., Kabbani, A., Edsall, T., Prabhakar, B., Vahdat, A. M., & Yasuda, M. (2012) · Networked Systems Design and Implementation · Cited by 524
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
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
Self-citationRate 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.2307/3010473 · Cited by 401
Developing a predictive model of quality of experience for internet video
Balachandran, A., Sekar, V., Akella, A., Seshan, S., Stoica, I., & Zhang, H. (2013) · Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM · doi:10.1145/2486001.2486025 · Cited by 349
A 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
PCC: Re-architecting Congestion Control for Consistent High Performance
Dong, M., Li, Q., Zarchy, D., Godfrey, B., & Schapira, M. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1409.7092 · Cited by 237
Pantheon: the training ground for internet congestion-control research
Yan, F. Y., Ma, J., Hill, G. D., Raghavan, D., Wahby, R. S., Levis, P. A., & Winstein, K. (2018) · USENIX Annual Technical Conference · Cited by 179
Impact of response latency on user behavior in web search
Arapakis, I., Bai, X., & Cambazoglu, B. B. (2014) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/2600428.2609627 · Cited by 164
An experimental study of the learnability of congestion control
Sivaraman, A., Winstein, K., Thaker, P., & Balakrishnan, H. (2014) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/2619239.2626324 · Cited by 105
Self-citationFlowtune: flowlet control for datacenter networks
Perry, J., Balakrishnan, H., & Shah, D. (2017) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 95
Self-citationTrickle: rate limiting YouTube video streaming
Ghobadi, M., Cheng, Y., Jain, A., & Mathis, M. (2012) · Cited by 87
Measuring the Quality of Experience of Web users
Bocchi, E., Cicco, L. D., & Rossi, D. (2016) · doi:10.1145/2940136.2940138 · Cited by 78
Experimental Evaluation of TCP-STAR for Satellite Internet over WINDS
Obata, H., Tamehiro, K., & Ishida, K. (2011) · International Symposium on Autonomous Decentralized Systems · doi:10.1109/isads.2011.86 · Cited by 28
Cited by
Classic Meets Modern: a Pragmatic Learning-Based Congestion Control for the Internet
Abbasloo, S., Yen, C.-Y., & Chao, H. J. (2020) · Proceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication · doi:10.1145/3387514.3405892 · Cited by 255
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
“Over the past decades, rule-based algorithms built on handcrafted control rules have played an important role in optimizing network systems [6, 8, 32, 107].”
Background
Metadata
- Authors
- Arun, V., & Balakrishnan, H.
- Venue
- Proceedings of the Applied Networking Research Workshop
- Publisher
- ACM
- Published
- 2018-07-16
- Pages
- 19-19
- OpenAlex
- W2885982708
- Cited by
- 333
- References
- 21
- Type
- conference abstract
- 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.