Article

Recursively cautious congestion control

Authors:

Radhika Mittal,

Justine Sherry,

Sylvia Ratnasamy,

Scott ShenkerAuthors Info & Claims

NSDI'14: Proceedings of the 11th USENIX Conference on Networked Systems Design and Implementation

Pages 373 - 385

Published: 02 April 2014 Publication History

Abstract

TCP's congestion control is deliberately cautious, avoiding network overloads by starting with a small initial window and then iteratively ramping up. As a result, it often takes flows several round-trip times to fully utilize the available bandwidth. In this paper we propose RC3, a technique to quickly take advantage of available capacity from the very first RTT. RC3 uses several levels of lower priority service and a modified TCP behavior to achieve near-optimal throughputs while preserving TCP-friendliness and fairness. We implement RC3 in the Linux kernel and in NS-3. In common wide-area scenarios, RC3 results in over 40% reduction in average flow completion times, with strongest improvements - more than 70% reduction in flow completion time - seen in medium to large sized (100KB - 3MB) flows.

References

[1]

CAIDA Internet Topology Data Kit. http://goo.gl/QAbecc.

[2]

Internet Traffic Flow Size Analysis. http://net.doit. wisc.edu/data/flow/size/.

[3]

iPerf. http://iperf.sourceforge.net/.

[4]

Measuring ISP Topologies with Rocketfuel. In Proc. ACM SIGCOMM, 2002.

Digital Library

[5]

M. Alizadeh, S. Yang, S. Katti, N. McKeown, B. Prabhakar, and S. Shenker. Deconstructing Datacenter Packet Transport. In Proc. ACM Workshop on Hot Topics in Networks (HotNets), 2012.

Digital Library

[6]

M. Allman. Comments on bufferbloat. ACM SIGCOMM Computer Communication Review, 2013.

Digital Library

[7]

M. Allman, S. Floyd, and C. Partridge. Increasing TCP's Initial Window. RFC 3390.

Digital Library

[8]

G. Appenzeller, I. Keslassy, and N. McKeown. Sizing router buffers. In Proc. ACM SIGCOMM, 2004.

Digital Library

[9]

E. Blanton, M. Allman, K. Fall, and L. Wang. A Conservative Selective Acknowledgment (SACK)-based Loss Recovery Algorithm for TCP. RFC 3517.

Digital Library

[10]

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

Digital Library

[11]

N. Dukkipati and N. McKeown. Why Flow-Completion Time is the Right Metric for Congestion Control. ACM SIGCOMM Computer Communication Review, 2006.

Digital Library

[12]

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, 2010.

Digital Library

[13]

T. Flach, N. Dukkipati, A. Terzis, B. Raghavan, N. Cardwell, Y. Cheng, A. Jain, S. Hao, E. Katz-Bassett, and R. Govindan. Reducing Web Latency: the Virtue of Gentle Aggression. In Proc. SIGCOMM, 2013.

Digital Library

[14]

S. Floyd. HighSpeed TCP for Large Congestion Windows. RFC 3649.

Digital Library

[15]

S. Floyd, M. Allman, A. Jain, and P. Sarolahti. Quick-Start for TCP and IP. RFC 4782.

[16]

S. Floyd and T. Henderson. The NewReno Modification to TCP's Fast Recovery Algorithm. RFC 2582.

Digital Library

[17]

S. Floyd, J. Mahdavi, M. Mathis, and M. Podolsky. An Extension to the Selective Acknowledgement (SACK) Option for TCP. RFC 2883.

Digital Library

[18]

C. Fraleigh, S. Moon, B. Lyles, C. Cotton, M. Khan, D. Moll, R. Rockell, T. Seely, and C. Diot. Packet-Level Traffic Measurements from the Sprint IP Backbone. IEEE Network, 2003.

Digital Library

[19]

S. Ha, I. Rhee, and L. Xu. CUBIC: a New TCP-friendly High-Speed TCP Variant. ACM SIGOPS Operating System Review, 2008.

Digital Library

[20]

M. Honda, Y. Nishida, C. Raiciu, A. Greengalgh, M. Handley, and H. Tokuda. Is it still possible to extend TCP? In Proc. IMC, 2011.

Digital Library

[21]

S. Iyer, S. Bhattacharyya, N. Taft, and C. Diot. An Approach to Alleviate Link Overload as Observed on an IP Backbone. In Proc. IEEE INFOCOM, 2003.

[22]

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

Digital Library

[23]

A. Kuzmanovic and E. W. Knightly. TCP-LP: Low-priority service via end-Point congestion Control. In IEEE/ACM ToN, 2006.

Digital Library

[24]

M. Mathis and J. Mahdavi. Forward acknowledgement: Refining tcp congestion control. ACM SIGCOMM Computer Communication Review, 1996.

Digital Library

[25]

M. Mathis, J. Mahdavi, S. Floyd, and A. Romanow. TCP Selective Acknowledgment Options. RFC 2018.

Digital Library

[26]

S. Nedevschi, L. Popa, G. Iannaccone, S. Ratnasamy, and D. Wetherall. Reducing network energy consumption via sleeping and rate-adaptation. In Proc. USENIX NSDI, 2008.

Digital Library

[27]

M. F. Nowlan, N. Tiwari, J. Iyengar, S. O. Aminy, and B. Fordy. Fitting Square Pegs Through Round Pipes: Unordered Delivery Wire-compatible with TCP and TLS. In Proc. USENIX NSDI, 2012.

Digital Library

[28]

V. N. Padmanabhan and R. H. Katz. TCP Fast Start: A Technique for Speeding Up Web Transfers. In Proc. IEEE Global Internet Conference (GLOBECOM), 1998.

[29]

C. Raiciu, C. Paasch, S. Barre, A. Ford, M. Honda, F. Duchene, O. Bonaventure, and M. Handley. How Hard Can It Be? Designing and Implementing a Deployable Multipath TCP. In Proc. USENIX NSDI, 2012.

Digital Library

[30]

A. Rao, A. Legout, Y. sup Lim, D. Towlsley, C. Barakat, and W. Dabbous. Network Characteristics of Video Streaming Traffic. In Proc. ACM CoNeXT, 2011.

Digital Library

[31]

C. Rotsos, H. Howard, D. Sheets, R. Mortier, A. Madhavapeddy, A. Chaudhry, and J. Crowcroft. Lost In the Edge: Finding Your Way With Signposts. In Proc. USENIX FOCI, 2013.

[32]

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

[33]

A. Venkataramani, R. Kokku, and M. Dahlin. Tcp nice: A mechanism for background transfers. In Proc. USENIX OSDI, 2002.

Digital Library

[34]

K. Winstein and H. Balakrishnan. TCP Ex Machina: Computer-generated Congestion Control. In Proc. ACM SIGCOMM, 2013.

Digital Library

[35]

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

Cited By

Suo LPang YLi WPei RLi KLiu XHe XHu YLiu GSekar VYu MSeneviratne AVeitch D(2024)PPT: A Pragmatic Transport for DatacentersProceedings of the ACM SIGCOMM 2024 Conference10.1145/3651890.3672235(954-969)Online publication date: 4-Aug-2024
https://dl.acm.org/doi/10.1145/3651890.3672235
Lim HKim JCho IJang KBai WHan DFedorova ANarayanan DDi Luna GQuerzoni L(2023)FlexPass: A Case for Flexible Credit-based Transport for Datacenter NetworksProceedings of the Eighteenth European Conference on Computer Systems10.1145/3552326.3587453(606-622)Online publication date: 8-May-2023
https://dl.acm.org/doi/10.1145/3552326.3587453
Brown LAnanthanarayanan GKatz-Bassett EKrishnamurthy ARatnasamy SSchapira MShenker SZhao BZheng HMadhyastha HPadmanabhan V(2020)On the Future of Congestion Control for the Public InternetProceedings of the 19th ACM Workshop on Hot Topics in Networks10.1145/3422604.3425939(30-37)Online publication date: 4-Nov-2020
https://dl.acm.org/doi/10.1145/3422604.3425939
Show More Cited By

Recursively cautious congestion control
1. General and reference
  1. Cross-computing tools and techniques
2. Networks

Recommendations

Configurable active multicast congestion control

A multicast congestion control and avoidance scheme is indispensable for group-based applications to fairly share and efficiently use network resources with unicast applications and maintain the stability of the Internet. It is difficult for the ...
General AIMD Congestion Control
Performance evaluation of Westwood+ TCP congestion control
Internet performance symposium (IPS 2002)

Westwood+ TCP is a sender-side only modification of the classic Tahoe/Reno TCP that has been recently proposed to improve fairness and efficiency of TCP. The key idea of Westwood+ TCP is to perform an end-to-end estimate of the bandwidth available for a ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

NSDI'14: Proceedings of the 11th USENIX Conference on Networked Systems Design and Implementation

April 2014

546 pages

ISBN:9781931971096

Program Chairs:
Ratul Mahajan
Microsoft Research
,
Ion Stoica
University of California at Berkeley

Sponsors

USENIX Assoc: USENIX Assoc

In-Cooperation

Publisher

USENIX Association

United States

Publication History

Published: 02 April 2014

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

20
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Suo LPang YLi WPei RLi KLiu XHe XHu YLiu GSekar VYu MSeneviratne AVeitch D(2024)PPT: A Pragmatic Transport for DatacentersProceedings of the ACM SIGCOMM 2024 Conference10.1145/3651890.3672235(954-969)Online publication date: 4-Aug-2024
https://dl.acm.org/doi/10.1145/3651890.3672235
Lim HKim JCho IJang KBai WHan DFedorova ANarayanan DDi Luna GQuerzoni L(2023)FlexPass: A Case for Flexible Credit-based Transport for Datacenter NetworksProceedings of the Eighteenth European Conference on Computer Systems10.1145/3552326.3587453(606-622)Online publication date: 8-May-2023
https://dl.acm.org/doi/10.1145/3552326.3587453
Brown LAnanthanarayanan GKatz-Bassett EKrishnamurthy ARatnasamy SSchapira MShenker SZhao BZheng HMadhyastha HPadmanabhan V(2020)On the Future of Congestion Control for the Public InternetProceedings of the 19th ACM Workshop on Hot Topics in Networks10.1145/3422604.3425939(30-37)Online publication date: 4-Nov-2020
https://dl.acm.org/doi/10.1145/3422604.3425939
Ware RMukerjee MSeshan SSherry J(2019)Beyond Jain's Fairness IndexProceedings of the 18th ACM Workshop on Hot Topics in Networks10.1145/3365609.3365855(17-24)Online publication date: 13-Nov-2019
https://dl.acm.org/doi/10.1145/3365609.3365855
Zhou JLi ZWu QSteenkiste PUhlig SLi JXie G(2019)TCP Stalls at the Server SideIEEE/ACM Transactions on Networking10.1109/TNET.2018.288628227:1(272-287)Online publication date: 1-Feb-2019
https://dl.acm.org/doi/10.1109/TNET.2018.2886282
Dong MMeng TZarchy DArslan EGilad YGodfrey PSchapira MSeshan SBanerjee S(2018)PCC vivaceProceedings of the 15th USENIX Conference on Networked Systems Design and Implementation10.5555/3307441.3307471(343-356)Online publication date: 9-Apr-2018
https://dl.acm.org/doi/10.5555/3307441.3307471
Mittal RShpiner APanda AZahavi EKrishnamurthy ARatnasamy SShenker SGorinsky STapolcai J(2018)Revisiting network support for RDMAProceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication10.1145/3230543.3230557(313-326)Online publication date: 7-Aug-2018
https://dl.acm.org/doi/10.1145/3230543.3230557
Narayan ACangialosi FGoyal PNarayana SAlizadeh MBalakrishnan H(2017)The Case for Moving Congestion Control Out of the DatapathProceedings of the 16th ACM Workshop on Hot Topics in Networks10.1145/3152434.3152438(101-107)Online publication date: 30-Nov-2017
https://dl.acm.org/doi/10.1145/3152434.3152438
Mittal RAgarwal RRatnasamy SShenker SArgyraki KIsaacs R(2016)Universal packet schedulingProceedings of the 13th Usenix Conference on Networked Systems Design and Implementation10.5555/2930611.2930644(501-521)Online publication date: 16-Mar-2016
https://dl.acm.org/doi/10.5555/2930611.2930644
Iftikhar ADogar FQazi IZegura EFord BSnoeren A(2016)Towards a Redundancy-Aware Network Stack for Data CentersProceedings of the 15th ACM Workshop on Hot Topics in Networks10.1145/3005745.3005764(57-63)Online publication date: 9-Nov-2016
https://dl.acm.org/doi/10.1145/3005745.3005764
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Table of Contents