research-article

Free access

Deadline-aware datacenter tcp (D2TCP)

Authors:

Balajee Vamanan,

Jahangir Hasan,

T.N. VijaykumarAuthors Info & Claims

SIGCOMM '12: Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication

Pages 115 - 126

https://doi.org/10.1145/2342356.2342388

Published: 13 August 2012 Publication History

Abstract

An important class of datacenter applications, called Online Data-Intensive (OLDI) applications, includes Web search, online retail, and advertisement. To achieve good user experience, OLDI applications operate under soft-real-time constraints (e.g., 300 ms latency) which imply deadlines for network communication within the applications. Further, OLDI applications typically employ tree-based algorithms which, in the common case, result in bursts of children-to-parent traffic with tight deadlines. Recent work on datacenter network protocols is either deadline-agnostic (DCTCP) or is deadline-aware (D3) but suffers under bursts due to race conditions. Further, D3 has the practical drawbacks of requiring changes to the switch hardware and not being able to coexist with legacy TCP. We propose Deadline-Aware Datacenter TCP (D2TCP), a novel transport protocol, which handles bursts, is deadline-aware, and is readily deployable. In designing D2TCP, we make two contributions: (1) D2TCP uses a distributed and reactive approach for bandwidth allocation which fundamentally enables D2TCP's properties. (2) D2TCP employs a novel congestion avoidance algorithm, which uses ECN feedback and deadlines to modulate the congestion window via a gamma-correction function. Using a small-scale implementation and at-scale simulations, we show that D2TCP reduces the fraction of missed deadlines compared to DCTCP and D3 by 75% and 50%, respectively.

Supplementary Material

JPG File (sigcomm-iii-01-deadlineawaredatacentertcp_d2tcp.jpg)

Download
23.48 KB

MP4 File (sigcomm-iii-01-deadlineawaredatacentertcp_d2tcp.mp4)

Download
85.13 MB

References

[1]

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

Digital Library

[2]

Charles A. Poynton (2003). Digital Video and HDTV: Algorithms and Interfaces. Morgan Kaufmann. pp. 260, 630. ISBN 1558607927.

Digital Library

[3]

B. Briscoe et. al. Policing Congestion Response in an Internetwork using Re-feedback. In Proc. SIGCOMM 2005.

Digital Library

[4]

Datacenter TCP, http://www.stanford.edu/~alizade/Site/DCTCP.htm

[5]

Nandita Dukkipati. RCP: Congestion Control to Make Flows Complete Quickly. PhD Thesis, Department of Electrical Engineering, Stanford University, October 2006.

[6]

D. Ferrari, A. Banerjea, and H. Zhang. Network support for multimedia: A discussion of the tenet approach. In Proc. Computer Networks and ISDN Systems, 1994.

Digital Library

[7]

S. Floyd. RFC 3649: HighSpeed TCP for large congestion windows.

Digital Library

[8]

S. Floyd and V. Jacobson. Random early detection gateways for congestion avoidance. IEEE/ACM Transactions on Networking, 1(4):397--413, 1993.

Digital Library

[9]

S. Floyd and V. Jacobson. The synchronization of periodic routing messages. IEEE/ACM Transactions on Networking, 2(2):122--136, 1994.

Digital Library

[10]

R. Griffith, Y. Chen, J. Liu, A. Joseph, and R. Katz. Understanding TCP incast throughput collapse in datacenter networks. In WREN Workshop, 2009.

Digital Library

[11]

Y. Gu, D. Towsley, C. Hollot, and H. Zhang. Congestion control for small buffer high bandwidth networks. In Proc. INFOCOM, 2007.

[12]

Urs Hoelzle, Jeffrey Dean, and Luiz André Barroso. Web Search for A Planet: The Architecture of the Google Cluster, In IEEE Micro Magazine, April 2003.

[13]

T. Ho. Latency is Everywhere and it Costs You Sales - How to Crush it, July 2009. http://highscalability.com/blog/2009/7/25/latency-iseverywhere-and-it-costs-you-sales-how-to-crush-it.html.

[14]

S. Iyer et. al. Analysis of a memory architecture for fast packet buffers. In IEEE HPSR Workshop, 2001.

[15]

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

Digital Library

[16]

Sam Liang and David Cheriton. TCP-RTM: Using TCP for Real Time Applications. In Proc. ICNP, 2002.

[17]

C. L. Liu and J. W. Layland. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment. Journal of the ACM, 20(1), 1973.

Digital Library

[18]

D. Meisner, C. M. Sadler, L. A. Barroso, W. Weber and T. F. Wenisch. Power Management of Online Data-Intensive Services. In Proc. ISCA, June 2011.

Digital Library

[19]

The ns-3 discrete-event network simulator. http://www.nsnam.org/

[20]

R. Pan, B. Prabhakar, and A. Laxmikantha. QCN: Quantized congestion notification an overview. http://www.ieee802.org/1/les/public/docs2007/au_prabhakar_qcn_overview_geneva.pdf

[21]

K. Ramakrishnan, S. Floyd, and D. Black. RFC 3168: The addition of explicit congestion notification (ECN) to IP.

Digital Library

[22]

I. R. Sangtae Ha and L. Xu. Cubic: A new TCP-friendly high-speed TCP variant. In Proc. SIGOPS-OSR, 2008.

Digital Library

[23]

V. Tsaoussidis and C. Zhang. 2002. TCP-Real: receiver-oriented congestion control. The International Journal of Computer and Telecommunications Networking. 40(4), 2002.

Digital Library

[24]

V. Vasudevan et al. Safe and effective fine-grained TCP retransmissions for datacenter communication. In Proc. SIGCOMM, 2009.

Digital Library

[25]

C. Wilson, H. Ballani, T. Karagiannis, A. Rowstron. Better Never Than Late: Meeting Deadlines in Datacenter Networks. In Proc. SIGCOMM, 2011.

Digital Library

[26]

C. Wilson, H. Ballani, T. Karagiannis, and A. Rowstron. Better never than late: Meeting deadlines in datacenter networks. Technical Report MSR-TR-2011--66, Microsoft Research, May 2011.

Digital Library

[27]

Y. Xia, L. Subramanian, I. Stoica, and S. Kalyanaraman. One more bit is enough. In Proc. SIGCOMM, 2005.

Digital Library

Cited By

Rajasekaran SNarang SZabreyko AGhobadi M(2024)MLTCP: A Distributed Technique to Approximate Centralized Flow Scheduling For Machine LearningProceedings of the 23rd ACM Workshop on Hot Topics in Networks10.1145/3696348.3696878(167-176)Online publication date: 18-Nov-2024
https://dl.acm.org/doi/10.1145/3696348.3696878
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
Canel CMadhavan BSundaresan SSpring NKannan PZhang YLin KSeshan SVallina-Rodríguez NSuarez-Tángil GLevin DPelsser C(2024)Understanding Incast Bursts in Modern DatacentersProceedings of the 2024 ACM on Internet Measurement Conference10.1145/3646547.3689028(674-680)Online publication date: 4-Nov-2024
https://dl.acm.org/doi/10.1145/3646547.3689028
Show More Cited By

Index Terms

Deadline-aware datacenter tcp (D2TCP)
1. Networks
  1. Network protocols

Recommendations

Data center TCP (DCTCP)
SIGCOMM '10: Proceedings of the ACM SIGCOMM 2010 conference

Cloud data centers host diverse applications, mixing workloads that require small predictable latency with others requiring large sustained throughput. In this environment, today's state-of-the-art TCP protocol falls short. We present measurements of a ...
Deadline-aware datacenter tcp (D2TCP)
Special october issue SIGCOMM '12

An important class of datacenter applications, called Online Data-Intensive (OLDI) applications, includes Web search, online retail, and advertisement. To achieve good user experience, OLDI applications operate under soft-real-time constraints (e.g., ...
Performance sensitivity and fairness of ECN-aware 'modified TCP'

The paper discusses how explicit congestion notification (ECN) can be used to devise an Internet congestion control mechanism that is more rapidly reactive and allows best-effort flows to rapidly adjust to fluctuations in available capacity. Our ECN-mod ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGCOMM '12: Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication

August 2012

474 pages

ISBN:9781450314190

DOI:10.1145/2342356

General Chairs:
Lars Eggert
NetApp, Germany
,
Jörg Ott
Aalto University, Finland
,
Program Chairs:
Venkat Padmanabhan
Microsoft Research, India
,
George Varghese
UCSD, USA

Copyright © 2012 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: 13 August 2012

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SIGCOMM '12

Sponsor:

SIGCOMM

SIGCOMM '12: ACM SIGCOMM 2012 Conference

August 13 - 17, 2012

Helsinki, Finland

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

284
Total Citations
View Citations
1,929
Total Downloads

Downloads (Last 12 months)225
Downloads (Last 6 weeks)32

Reflects downloads up to 13 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Rajasekaran SNarang SZabreyko AGhobadi M(2024)MLTCP: A Distributed Technique to Approximate Centralized Flow Scheduling For Machine LearningProceedings of the 23rd ACM Workshop on Hot Topics in Networks10.1145/3696348.3696878(167-176)Online publication date: 18-Nov-2024
https://dl.acm.org/doi/10.1145/3696348.3696878
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
Canel CMadhavan BSundaresan SSpring NKannan PZhang YLin KSeshan SVallina-Rodríguez NSuarez-Tángil GLevin DPelsser C(2024)Understanding Incast Bursts in Modern DatacentersProceedings of the 2024 ACM on Internet Measurement Conference10.1145/3646547.3689028(674-680)Online publication date: 4-Nov-2024
https://dl.acm.org/doi/10.1145/3646547.3689028
Gupta JKant KPal ABiswas J(2024)Configuring and Coordinating End-to-end QoS for Emerging Storage InfrastructureACM Transactions on Modeling and Performance Evaluation of Computing Systems10.1145/36316069:1(1-32)Online publication date: 15-Jan-2024
https://dl.acm.org/doi/10.1145/3631606
Tao XQian XHan LFan WShi YZhu XLi ZWei SXu R(2024)Key Flow First Prioritized Flow Scheduling Strategy in Multi-Tenant Data CentersIEEE Transactions on Network and Service Management10.1109/TNSM.2024.336414921:3(3264-3277)Online publication date: Jun-2024
https://doi.org/10.1109/TNSM.2024.3364149
Lu YMa XCui C(2024)DCCSComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2024.110457247:COnline publication date: 18-Jul-2024
https://dl.acm.org/doi/10.1016/j.comnet.2024.110457
AYDOĞAN H(2023)Dijital Ebeveynlik ve Reklamcılık Odağındaki Araştırmaların Bibliyometrik İncelemesi: Mevcut Eğilimler ve Gelecek YönelimleriA Bibliometric Analysis of Research on Digital Parenting and Advertising: Current Trends and Future directionsTRT Akademi10.37679/trta.132821708:19(876-903)Online publication date: 30-Sep-2023
https://doi.org/10.37679/trta.1328217
Wen ZYang RQian BXuan YLu LWang ZPeng HXu JZomaya ARanjan R(2023)Janus: Latency-Aware Traffic Scheduling for IoT Data Streaming in Edge EnvironmentsIEEE Transactions on Services Computing10.1109/TSC.2023.331213116:6(4302-4316)Online publication date: Nov-2023
https://doi.org/10.1109/TSC.2023.3312131
Gao CChu SXu HXu MYe KXu C(2023) Flash : Joint Flow Scheduling and Congestion Control in Data Center Networks IEEE Transactions on Cloud Computing10.1109/TCC.2021.312951111:1(1038-1049)Online publication date: 1-Jan-2023
https://doi.org/10.1109/TCC.2021.3129511
Chang HKodialam MLakshman TMukherjee SVan der Merwe JZaheer Z(2023)MAGNet: Machine Learning Guided Application-Aware Networking for Data CentersIEEE Transactions on Cloud Computing10.1109/TCC.2021.308744711:1(291-307)Online publication date: 1-Jan-2023
https://doi.org/10.1109/TCC.2021.3087447
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