research-article

Free access

TCP ex machina: computer-generated congestion control

Authors:

Keith Winstein,

Hari BalakrishnanAuthors Info & Claims

SIGCOMM '13: Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM

Pages 123 - 134

https://doi.org/10.1145/2486001.2486020

Published: 27 August 2013 Publication History

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.

In this approach, the protocol designer specifies their prior knowledge or assumptions about the network and an objective that the algorithm will try to achieve, e.g., high throughput and low queueing delay. Remy then produces a distributed algorithm---the control rules for the independent endpoints---that tries to achieve this objective.

In simulations with ns-2, Remy-generated algorithms outperformed human-designed end-to-end techniques, including TCP Cubic, Compound, and Vegas. In many cases, Remy's algorithms also outperformed methods that require intrusive in-network changes, including XCP and Cubic-over-sfqCoDel (stochastic fair queueing with CoDel for active queue management).

Remy can generate algorithms both for networks where some parameters are known tightly a priori, e.g. datacenters, and for networks where prior knowledge is less precise, such as cellular networks. We characterize the sensitivity of the resulting performance to the specificity of the prior knowledge, and the consequences when real-world conditions contradict the assumptions supplied at design-time.

References

[1]

A. Akella, S. Seshan, R. Karp, S. Shenker, and C. Papadimitriou. Selfish Behavior and Stability of the Internet: A Game-Theoretic Analysis of TCP. In SIGCOMM, 2002.

Digital Library

[2]

M. Alizadeh, A. Greenberg, D. A. Maltz, J. Padhye, P. Patel, B. Prabhakar, S. Sengupta, and M. Sridharan. Data Center TCP (DCTCP). In SIGCOMM, 2010.

Digital Library

[3]

M. Allman. Initial Congestion Window Specification. http://tools.ietf.org/html/draft-allman-tcpm-bump-initcwnd-00, 2010.

[4]

M. Allman. Comments on Bufferbloat. ACM SIGCOMM Computer Communication Review, 43(1), Jan. 2013.

Digital Library

[5]

H. Balakrishnan, H. S. Rahul, and S. Seshan. An Integrated Congestion Management Architecture for Internet Hosts. In SIGCOMM, 1999.

Digital Library

[6]

D. Bansal and H. Balakrishnan. Binomial Congestion Control Algorithms. In INFOCOM, 2001.

[7]

D. Bansal, H. Balakrishnan, S. Floyd, and S. Shenker. Dynamic Behavior of Slowly-Responsive Congestion Control Algorithms. In SIGCOMM, 2001.

Digital Library

[8]

D. S. Bernstein, R. Givan, N. Immerman, and S. Zilberstein. The Complexity of Decentralized Control of Markov Decision Processes. Mathematics of Operations Research, 27(4):819--840, Nov. 2002.

Digital Library

[9]

L. S. Brakmo, S. W. O'Malley, and L. L. Peterson. TCP Vegas: New Techniques for Congestion Detection and Avoidance. In SIGCOMM, 1994.

Digital Library

[10]

D.-M. Chiu and R. Jain. Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks. Computer Networks and ISDN Systems, 17:1--14, 1989.

Digital Library

[11]

J. Chu, N. Dukkipati, Y. Cheng, and M. Mathis. Increasing TCP's Initial Window. http://tools.ietf.org/html/draft-ietf-tcpm-initcwnd-08, 2013.

[12]

D. Clark. The Design Philosophy of the DARPA Internet Protocols. In SIGCOMM, 1988.

Digital Library

[13]

N. Dukkipati, T. Refice, Y. Cheng, J. Chu, T. Herbert, A. Agarwal, A. Jain, and N. Sutin. An Argument for Increasing TCP's Initial Congestion Window. ACM SIGCOMM Computer Communication Review, 40(3):27--33, 2010.

Digital Library

[14]

W. Feng, K. Shin, D. Kandlur, and D. Saha. The BLUE Active Queue Management Algorithms. IEEE/ACM Trans. on Networking, Aug. 2002.

Digital Library

[15]

S. Floyd. TCP and Explicit Congestion Notification. CCR, 24(5), Oct. 1994.

Digital Library

[16]

S. Floyd, M. Handley, J. Padhye, and J. Widmer. Equation-Based Congestion Control for Unicast Applications. In SIGCOMM, 2000.

Digital Library

[17]

S. Floyd and V. Jacobson. Random Early Detection Gateways for Congestion Avoidance. IEEE/ACM Trans. on Networking, 1(4), Aug. 1993.

Digital Library

[18]

S. Ha, I. Rhee, and L. Xu. CUBIC: A New TCP-Friendly High-Speed TCP Variant. ACM SIGOPS Operating System Review, 42(5):64--74, July 2008.

Digital Library

[19]

J. C. Hoe. Improving the Start-up Behavior of a Congestion Control Scheme for TCP. In SIGCOMM, 1996.

Digital Library

[20]

D. Hofstadter. Metamagical Themas: Questing for the Essence of Mind and Pattern. Basic books, 1985.

Digital Library

[21]

V. Jacobson. Congestion Avoidance and Control. In SIGCOMM, 1988.

Digital Library

[22]

R. Jain. A Delay-based Approach for Congestion Avoidance in Interconnected Heterogeneous Computer Networks. In SIGCOMM, 1989.

Digital Library

[23]

P. Karn, C. Bormann, G. Fairhurst, D. Grossman, R. Ludwig, J. Mahdavi, G. Montenegro, J. Touch, and L. Wood. Advice for Internet Subnetwork Designers, 2004. RFC 3819, IETF.

[24]

D. Katabi, M. Handley, and C. Rohrs. Congestion Control for High Bandwidth-Delay Product Networks. In SIGCOMM, 2002.

Digital Library

[25]

F. P. Kelly, A. Maulloo, and D. Tan. Rate Control in Communication Networks: Shadow Prices, Proportional Fairness and Stability. Journal of the Operational Research Society, 49:237--252, 1998.

[26]

E. Kohler, M. Handley, and S. Floyd. Designing DCCP: Congestion control Without Reliability. In SIGCOMM, 2006.

Digital Library

[27]

S. Kunniyur and R. Srikant. Analysis and Design of an Adaptive Virtual Queue (AVQ) Algorithm for Active Queue Management. In SIGCOMM, 2001.

Digital Library

[28]

T. Lan, D. Kao, M. Chiang, and A. Sabharwal. An Axiomatic Theory of Fairness. In INFOCOM, 2010.

Digital Library

[29]

D. Leith and R. Shorten. H-TCP Protocol for High-Speed Long Distance Networks. In PFLDNet, 2004.

[30]

S. Mascolo, C. Casetti, M. Gerla, M. Sanadidi, and R. Wang. TCP Westwood: Bandwidth Estimation for Enhanced Transport over Wireless Links. In MobiCom, 2001.

Digital Library

[31]

P. E. McKenney. Stochastic Fairness Queueing. In INFOCOM, 1990.

[32]

D. Meagher. Geometric Modeling Using Octree Encoding. Computer Graphics and Image Processing, 19(2):129--147, 1982.

[33]

K. Nichols and V. Jacobson. Controlling Queue Delay. ACM Queue, 10(5), May 2012.

Digital Library

[34]

F. A. Oliehoek. Decentralized POMDPs. In In Reinforcement Learning: State of the Art, Adaptation, Learning, and Optimization, pages 471--503, 2012.

[35]

R. Pan, B. Prabhakar, and K. Psounis. CHOKe--A Stateless Active Queue Management Scheme for Approximating Fair Bandwidth Allocation. In INFOCOM, 2000.

[36]

R. Srikant. The Mathematics of Internet Congestion Control. Birkhauser, 2004.

Digital Library

[37]

C. Tai, J. Zhu, and N. Dukkipati. Making Large Scale Deployment of RCP Practical for Real Networks. In INFOCOM, 2008.

[38]

K. Tan, J. Song, Q. Zhang, and M. Sridharan. A Compound TCP Approach for High-speed and Long Distance Networks. In INFOCOM, 2006.

[39]

J. Touch. Automating the Initial Window in TCP. http://tools.ietf.org/html/draft-touch-tcpm-automatic-iw-03, 2012.

[40]

Z. Wang and J. Crowcroft. A New Congestion Control Scheme: Slow Start and Search (Tri-S). In SIGCOMM, 1991.

Digital Library

[41]

D. Wei, C. Jin, S. Low, and S. Hegde. FAST TCP: Motivation, Architecture, Algorithms, Performance. IEEE/ACM Trans. on Networking, 14(6):1246--1259, 2006.

Digital Library

[42]

K. Winstein and H. Balakrishnan. End-to-End Transmission Control by Modeling Uncertainty about the Network State . In HotNets-X, 2011.

Digital Library

[43]

Y. Xia, L. Subramanian, I. Stoica, and S. Kalyanaraman. One More Bit is Enough. IEEE/ACM Trans. on Networking, 16(6):1281--1294, 2008.

Digital Library

[44]

L. Xu, K. Harfoush, and I. Rhee. Binary Increase Congestion Control (BIC) for Fast Long-Distance Networks. In INFOCOM, 2004.

[45]

Y. Yi and M. Chiang. Stochastic Network Utility Maximisation. European Transactions on Telecommunications, 19(4):421--442, 2008.

[46]

K. K. Ramakrishnan and R. Jain. A Binary Feedback Scheme for Congestion Avoidance in Computer Networks. ACM Trans. on Comp. Sys., 8(2):158--181, May 1990.

Digital Library

Cited By

Ware RPhilip AHungria NKothari YSherry JSeshan SSekar VYu MSeneviratne AVeitch D(2024)CCAnalyzer: An Efficient and Nearly-Passive Congestion Control ClassifierProceedings of the ACM SIGCOMM 2024 Conference10.1145/3651890.3672255(181-196)Online publication date: 4-Aug-2024
https://dl.acm.org/doi/10.1145/3651890.3672255
Liao XTian HZeng CWan XChen K(2024)Astraea: Towards Fair and Efficient Learning-based Congestion ControlProceedings of the Nineteenth European Conference on Computer Systems10.1145/3627703.3650069(99-114)Online publication date: 22-Apr-2024
https://dl.acm.org/doi/10.1145/3627703.3650069
Zhang HZhou AWang GLi CMa H(2024)Toward Optimal Live Video Streaming QoE: A Deep Feature-Fusion ApproachIEEE/ACM Transactions on Networking10.1109/TNET.2024.335183232:3(2360-2375)Online publication date: Jun-2024
https://doi.org/10.1109/TNET.2024.3351832
Show More Cited By

Index Terms

TCP ex machina: computer-generated congestion control
1. Networks
  1. Network protocols

Recommendations

TCP ex machina: computer-generated congestion control

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 ...
CODE TCP: A competitive delay-based TCP

TCP Vegas is a well-known delay-based congestion control mechanism. Studies have indicated that TCP Vegas outperforms TCP Reno in many aspects. However, Reno currently remains the most widely deployed TCP variant in the Internet. This is mainly because ...
TCP westwood: end-to-end congestion control for wired/wireless networks

TCP Westwood (TCPW) is a sender-side modification of the TCP congestion window algorithm that improves upon the performance of TCP Reno in wired as well as wireless networks. The improvement is most significant in wireless networks with lossy links. In ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGCOMM '13: Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM

August 2013

580 pages

ISBN:9781450320566

DOI:10.1145/2486001

General Chairs:
Dah Ming Chiu
Chinese University of Hong Kong, China
,
Jia Wang
AT&T Labs - Research, USA
,
Program Chairs:
Paul Barford
University of Wisconsin, USA
,
Srinivasan Seshan
Carnegie Mellon University, USA

ACM SIGCOMM Computer Communication Review Volume 43, Issue 4
October 2013
595 pages
ISSN:0146-4833
DOI:10.1145/2534169
Issue’s Table of Contents

Copyright © 2013 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

SIGCOMM: ACM Special Interest Group on Data Communication

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 August 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SIGCOMM'13

Sponsor:

SIGCOMM

SIGCOMM'13: ACM SIGCOMM 2013 Conference

August 12 - 16, 2013

Hong Kong, China

Acceptance Rates

SIGCOMM '13 Paper Acceptance Rate 38 of 246 submissions, 15%;

Overall Acceptance Rate 462 of 3,389 submissions, 14%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

378
Total Citations
View Citations
2,719
Total Downloads

Downloads (Last 12 months)397
Downloads (Last 6 weeks)31

Reflects downloads up to 22 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Ware RPhilip AHungria NKothari YSherry JSeshan SSekar VYu MSeneviratne AVeitch D(2024)CCAnalyzer: An Efficient and Nearly-Passive Congestion Control ClassifierProceedings of the ACM SIGCOMM 2024 Conference10.1145/3651890.3672255(181-196)Online publication date: 4-Aug-2024
https://dl.acm.org/doi/10.1145/3651890.3672255
Liao XTian HZeng CWan XChen K(2024)Astraea: Towards Fair and Efficient Learning-based Congestion ControlProceedings of the Nineteenth European Conference on Computer Systems10.1145/3627703.3650069(99-114)Online publication date: 22-Apr-2024
https://dl.acm.org/doi/10.1145/3627703.3650069
Zhang HZhou AWang GLi CMa H(2024)Toward Optimal Live Video Streaming QoE: A Deep Feature-Fusion ApproachIEEE/ACM Transactions on Networking10.1109/TNET.2024.335183232:3(2360-2375)Online publication date: Jun-2024
https://doi.org/10.1109/TNET.2024.3351832
Tian HLiao XZeng CSun DZhang JChen K(2024)Efficient DRL-Based Congestion Control With Ultra-Low OverheadIEEE/ACM Transactions on Networking10.1109/TNET.2023.333073732:3(1888-1903)Online publication date: Jun-2024
https://doi.org/10.1109/TNET.2023.3330737
Jiang WLi HWu JLiu ZHuang JShan DWang J(2024)Improvement of Copa: Behaviors and Friendliness of Delay-Based Congestion Control AlgorithmIEEE/ACM Transactions on Networking10.1109/TNET.2023.327867732:1(127-142)Online publication date: Feb-2024
https://doi.org/10.1109/TNET.2023.3278677
Shan DJiang LZhang PJiang WLi HTang YRen F(2024)Enforcing Fairness in the Traffic Policer Among Heterogeneous Congestion Control AlgorithmsIEEE/ACM Transactions on Networking10.1109/TNET.2023.327641032:1(34-49)Online publication date: Feb-2024
https://doi.org/10.1109/TNET.2023.3276410
He QWang YWang XXu WLi FYang KMa L(2024)Routing Optimization With Deep Reinforcement Learning in Knowledge Defined NetworkingIEEE Transactions on Mobile Computing10.1109/TMC.2023.323544623:2(1444-1455)Online publication date: Feb-2024
https://doi.org/10.1109/TMC.2023.3235446
Zheng ZXia ZChou YChen Y(2024)TRCC: Transferable Congestion Control With Reinforcement LearningIEEE Internet of Things Journal10.1109/JIOT.2023.329237111:2(2273-2285)Online publication date: 15-Jan-2024
https://doi.org/10.1109/JIOT.2023.3292371
Zhang ZLi SGe YXiong GZhang YXiong K(2023)PBQ-Enhanced QUIC: QUIC with Deep Reinforcement Learning Congestion Control MechanismEntropy10.3390/e2502029425:2(294)Online publication date: 4-Feb-2023
https://doi.org/10.3390/e25020294
Zadeh SZandi FBuckley MGanjali Y(2023)Meta-Migration: Reducing Switch Migration Tail Latency Through Competition2023 IFIP Networking Conference (IFIP Networking)10.23919/IFIPNetworking57963.2023.10186446(1-9)Online publication date: 12-Jun-2023
https://doi.org/10.23919/IFIPNetworking57963.2023.10186446
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents