More Web Proxy on the site http://driver.im/

research-article

Open access

Reducing web latency: the virtue of gentle aggression

Authors:

Nandita Dukkipati,

Andreas Terzis,

Barath Raghavan,

Ethan Katz-Bassett,

Ramesh GovindanAuthors Info & Claims

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

Pages 159 - 170

https://doi.org/10.1145/2486001.2486014

Published: 27 August 2013 Publication History

Abstract

To serve users quickly, Web service providers build infrastructure closer to clients and use multi-stage transport connections. Although these changes reduce client-perceived round-trip times, TCP's current mechanisms fundamentally limit latency improvements. We performed a measurement study of a large Web service provider and found that, while connections with no loss complete close to the ideal latency of one round-trip time, TCP's timeout-driven recovery causes transfers with loss to take five times longer on average.

In this paper, we present the design of novel loss recovery mechanisms for TCP that judiciously use redundant transmissions to minimize timeout-driven recovery. Proactive, Reactive, and Corrective are three qualitatively-different, easily-deployable mechanisms that (1) proactively recover from losses, (2) recover from them as quickly as possible, and (3) reconstruct packets to mask loss. Crucially, the mechanisms are compatible both with middleboxes and with TCP's existing congestion control and loss recovery. Our large-scale experiments on Google's production network that serves billions of flows demonstrate a 23% decrease in the mean and 47% in 99th percentile latency over today's TCP.

References

[1]

Web Page Replay. http://code.google.com/p/web-page-replay/.

[2]

Akamai. The State of the Internet (3rd Quarter 2012), 2012. http://www.akamai.com/stateoftheinternet/.

[3]

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

Digital Library

[4]

M. Allman, K. Avrachenkov, U. Ayesta, J. Blanton, and P. Hurtig. Early retransmit for TCP and SCTP, May 2010. RFC 5827.

[5]

M. Allman, H. Balakrishnan, and S. Floyd. Enhancing TCP's Loss Recovery Using Limited Transmit, January 2001. RFC 3042.

Digital Library

[6]

M. Allman, V. Paxson, and E. Blanton. TCP congestion control, September 2009. RFC 5681.

[7]

H. Balakrishnan, V. N. Padmanabhan, S. Seshan, M. Stemm, and R. H. Katz. TCP Behavior of a Busy Internet Server: Analysis and Improvements. In Proc. of INFOCOM, 1998.

[8]

M. Balakrishnan, T. Marian, K. P. Birman, H. Weatherspoon, and L. Ganesh. Maelstrom: transparent error correction for communication between data centers. IEEE/ACM Trans. Netw., 19(3), June 2011.

Digital Library

[9]

L. Baldantoni, H. Lundqvist, and G. Karlsson. Adaptive end-to-end FEC for improving TCP performance over wireless links. In Proc. of Conf. on Commun., June 2004.

[10]

E. Blanton and M. Allman. Using TCP DSACKs and SCTP duplicate TSNs to detect spurious retransmissions, February 2004. RFC 3708.

[11]

E. Blanton, M. Allman, L. Wang, I. Jarvinen, M. Kojo, and Y. Nishida. A Conservative Loss Recovery Algorithm Based on Selective Acknowledgment (SACK) for TCP, 2012. RFC 6675.

[12]

L. Brakmo, S. O'Malley, and L. Peterson. TCP Vegas: End to End Congestion Avoidance on a Global Internet. ACM Comput. Commun. Rev., August 1996.

[13]

M. Carbone and L. Rizzo. Dummynet revisited. ACM Comput. Commun. Rev., 40(2), 2010.

Digital Library

[14]

N. Dukkipati. tcp: Tail Loss Probe (TLP). http://lwn.net/Articles/542642/.

[15]

N. Dukkipati, N. Cardwell, Y. Cheng, and M. Mathis. Tail Loss Probe (TLP): An Algorithm for Fast Recovery of Tail Losses, Feburary 2013. draft-dukkipati-tcpm-tcp-loss-probe-01.

[16]

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 Comput. Commun. Rev., 40, 2010.

Digital Library

[17]

C. Griwodz and P. Halvorsen. The fun of using TCP for an MMORPG. In Proc. of NOSSDAV, 2006.

Digital Library

[18]

S. Ha, I. Rhee, and L. Xu. CUBIC: a new TCP-friendly high-speed TCP variant. SIGOPS Oper. Syst. Rev., 42(5), July 2008.

Digital Library

[19]

D. Han, A. Anand, A. Akella, and S. Seshan. RPT: Re-architecting Loss Protection for Content-Aware Networks. In Proc. of NSDI, 2012.

Digital Library

[20]

J. Hoe. Improving the start-up behavior of a congestion control scheme for TCP. ACM Comput. Commun. Rev., August 1996.

Digital Library

[21]

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

Digital Library

[22]

A. Hughes, J. Touch, and J. Heidemann. Issues in TCP Slow-Start Restart after Idle, December 2001. draft-hughes-restart-00.

[23]

M. Kim, J. Cloud, A. ParandehGheibi, L. Urbina, K. Fouli, D. Leith, and M. Medard. Network Coded TCP (CTCP). arXiv:1212.2291.

[24]

R. Krishnan, H. V. Madhyastha, S. Jain, S. Srinivasan, A. Krishnamurthy, T. Anderson, and J. Gao. Moving Beyond End-to-End Path Information to Optimize CDN Performance. In Proc. of IMC, 2009.

Digital Library

[25]

D. Lin and H. Kung. TCP fast recovery strategies: Analysis and improvements. In Proc. of INFOCOM, 1998.

[26]

G. Linden. Make Data Useful. http://sites.google.com/site/glinden/Home/StanfordDataMining.2006--11--28%.ppt, 2006.

[27]

R. Ludwig and R. H. Katz. The Eifel Algorithm: Making TCP Robust Against Spurious Retransmissions. (ACM) Comp. Commun. Rev., 30(1), January 2000.

Digital Library

[28]

M. Mathis. Relentless Congestion Control, March 2009. draft-mathis-iccrg-relentless-tcp-00.txt.

[29]

M. Mathis and J. Mahdavi. Forward acknowledgment: refining TCP congestion control. ACM Comput. Commun. Rev., 26(4), August 1996.

Digital Library

[30]

A. Mondal and A. Kuzmanovic. Removing exponential backoff from TCP. ACM Comput. Commun. Rev., 38(5), September 2008.

Digital Library

[31]

A. Petlund, K. Evensen, C. Griwodz, and P. Halvorsen. TCP enhancements for interactive thin-stream applications. In Proc. of NOSSDAV, 2008.

Digital Library

[32]

S. Radhakrishnan, Y. Cheng, J. Chu, A. Jain, and B. Raghavan. TCP Fast Open. In Proc. of CoNEXT, 2011.

Digital Library

[33]

B. Raghavan and A. Snoeren. Decongestion Control. In Proc. of HotNets, 2006.

[34]

K. Ramakrishnan, S. Floyd, and D. Black. The Addition of Explicit Congestion Notification (ECN) to IP, September 2001. RFC 3042.

[35]

I. Reed and G. Solomon. Polynomial Codes over Certain Finite Fields. Journ. of the Soc. for Industr. and Appl. Math., 8(2), jun 1960.

[36]

S. Rewaskar, J. Kaur, and F. D. Smith. A performance study of loss detection/recovery in real-world TCP implementations. Proc. of ICNP, 2007.

[37]

P. Sarolahti, M. Kojo, K. Yamamoto, and M. Hata. Forward RTO-Recovery (F-RTO): An Algorithm for Detecting Spurious Retransmission Timeouts with TCP, September 2009. RFC 5682.

[38]

P. Sarolahti and A. Kuznetsov. Congestion Control in Linux TCP. In Proc. of USENIX, 2002.

Digital Library

[39]

R. Scheffenegger. Improving SACK-based loss recovery for TCP, November 2010. draft-scheffenegger-tcpm-sack-loss-recovery-00.txt.

[40]

P. Sun, M. Yu, M. J. Freedman, and J. Rexford. Identifying Performance Bottlenecks in CDNs through TCP-Level Monitoring. In SIGCOMM Workshop on Meas. Up the Stack, August 2011.

Digital Library

[41]

J. Sundararajan, D. Shah, M. Medard, S. Jakubczak, M. Mitzenmacher, and J. Barros. Network Coding Meets TCP: Theory and Implementation. Proc. of the IEEE, 99(3), March 2011.

[42]

S. Sundaresan, W. de Donato, N. Feamster, R. Teixeira, S. Crawford, and A. Pescapè. Broadband Internet Performance: A View from the Gateway. ACM Comput. Commun. Rev., 41(4), 2011.

Digital Library

[43]

O. Tickoo, V. Subramanian, S. Kalyanaraman, and K. Ramakrishnan. LT-TCP: End-to-End Framework to improve TCP Performance over Networks with Lossy Channels. In Proc. of IWQoS, 2005.

Digital Library

[44]

A. Vulimiri, O. Michel, P. B. Godfrey, and S. Shenker. More is less: reducing latency via redundancy. In Proc. of HotNets, 2012.

Digital Library

[45]

M. Walfish, M. Vutukuru, H. Balakrishnan, D. Karger, and S. Shenker. DDoS defense by offense. In Proc. of SIGCOMM, 2006.

Digital Library

[46]

D. Zats, T. Das, P. Mohan, D. Borthakur, and R. Katz. DeTail: reducing the flow completion time tail in datacenter networks. In Proc. of SIGCOMM, 2012.

Digital Library

Cited By

Chen WTian YYu XZheng BZhang X(2024)Enhancing Fairness for Approximate Weighted Fair Queueing With a Single QueueIEEE/ACM Transactions on Networking10.1109/TNET.2024.339921232:5(3901-3915)Online publication date: Oct-2024
https://doi.org/10.1109/TNET.2024.3399212
Meng QZhang YZhang SWang ZZhang TLuo HRen F(2024)Switch-Assistant Loss Recovery for RDMA Transport ControlIEEE/ACM Transactions on Networking10.1109/TNET.2023.333666132:3(2069-2084)Online publication date: Jun-2024
https://doi.org/10.1109/TNET.2023.3336661
Kim SLee W(2024)In-Sender Reordering Compensation for RACK in Container Overlay NetworksIEEE Open Journal of the Communications Society10.1109/OJCOMS.2024.35013225(7467-7482)Online publication date: 2024
https://doi.org/10.1109/OJCOMS.2024.3501322
Show More Cited By

Index Terms

Reducing web latency: the virtue of gentle aggression
1. General and reference
  1. Cross-computing tools and techniques
  2. Document types
    1. Computing standards, RFCs and guidelines
2. Networks
  1. Network protocols

Recommendations

Reducing web latency: the virtue of gentle aggression

To serve users quickly, Web service providers build infrastructure closer to clients and use multi-stage transport connections. Although these changes reduce client-perceived round-trip times, TCP's current mechanisms fundamentally limit latency ...
TCP-Illinois: a loss and delay-based congestion control algorithm for high-speed networks
valuetools '06: Proceedings of the 1st international conference on Performance evaluation methodolgies and tools

We introduce a new congestion control algorithm, called TCP-Illinois, which has many desirable properties for implementation in (very) high-speed networks. TCP-Illinois is a sender side protocol, which modifies the AIMD algorithm of the standard TCP (...
An argument for increasing TCP's initial congestion window

TCP flows start with an initial congestion window of at most four segments or approximately 4KB of data. Because most Web transactions are short-lived, the initial congestion window is a critical TCP parameter in determining how quickly flows can ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

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 ACM 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

162
Total Citations
View Citations
2,282
Total Downloads

Downloads (Last 12 months)214
Downloads (Last 6 weeks)36

Reflects downloads up to 13 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Chen WTian YYu XZheng BZhang X(2024)Enhancing Fairness for Approximate Weighted Fair Queueing With a Single QueueIEEE/ACM Transactions on Networking10.1109/TNET.2024.339921232:5(3901-3915)Online publication date: Oct-2024
https://doi.org/10.1109/TNET.2024.3399212
Meng QZhang YZhang SWang ZZhang TLuo HRen F(2024)Switch-Assistant Loss Recovery for RDMA Transport ControlIEEE/ACM Transactions on Networking10.1109/TNET.2023.333666132:3(2069-2084)Online publication date: Jun-2024
https://doi.org/10.1109/TNET.2023.3336661
Kim SLee W(2024)In-Sender Reordering Compensation for RACK in Container Overlay NetworksIEEE Open Journal of the Communications Society10.1109/OJCOMS.2024.35013225(7467-7482)Online publication date: 2024
https://doi.org/10.1109/OJCOMS.2024.3501322
Meng ZXu MMeng ZXu M(2024)Transport Layer on Data Path: Differentiating RetransmissionsLatency Optimization in Interactive Multimedia Streaming10.1007/978-981-97-6729-8_6(87-108)Online publication date: 30-Oct-2024
https://doi.org/10.1007/978-981-97-6729-8_6
Ozcan SLivadariu ISmaragdakis GGriwodz C(2023)Longitudinal Analysis of Inter-City Network Delays2023 7th Network Traffic Measurement and Analysis Conference (TMA)10.23919/TMA58422.2023.10198987(1-9)Online publication date: 26-Jun-2023
https://doi.org/10.23919/TMA58422.2023.10198987
Zhang YIsaacs RYue YYang JZhang LVigfusson Y(2023)LatenSeerProceedings of the 2023 ACM Symposium on Cloud Computing10.1145/3620678.3624787(502-519)Online publication date: 30-Oct-2023
https://dl.acm.org/doi/10.1145/3620678.3624787
Zhu XShe GXue BZhang YZhang YZou XDuan XHe PKrishnamurthy ALentz MZhuo DMahajan R(2023)Dissecting Overheads of Service Mesh SidecarsProceedings of the 2023 ACM Symposium on Cloud Computing10.1145/3620678.3624652(142-157)Online publication date: 30-Oct-2023
https://dl.acm.org/doi/10.1145/3620678.3624652
Ni YZheng ZLin XGao FZeng XLiu YXu TWang HZhang ZDu SYang GSu YCai DLiu HXu CZhai EMa YSchulzrinne HKohler EMaltz DMisra V(2023)CellFusion: Multipath Vehicle-to-Cloud Video Streaming with Network Coding in the WildProceedings of the ACM SIGCOMM 2023 Conference10.1145/3603269.3604832(668-683)Online publication date: 10-Sep-2023
https://dl.acm.org/doi/10.1145/3603269.3604832
Peng ZZhang MLi KJin RRen BDehnavi MKulkarni MKrishnamoorthy S(2023)iQANProceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming10.1145/3572848.3577527(313-328)Online publication date: 25-Feb-2023
https://dl.acm.org/doi/10.1145/3572848.3577527
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
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

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