skip to main content
10.1145/2342356.2342388acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
research-article
Free Access

Deadline-aware datacenter tcp (D2TCP)

Published:13 August 2012Publication 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.

Skip Supplemental Material Section

Supplemental Material

sigcomm-iii-01-deadlineawaredatacentertcp_d2tcp.mp4

mp4

85.1 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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Charles A. Poynton (2003). Digital Video and HDTV: Algorithms and Interfaces. Morgan Kaufmann. pp. 260, 630. ISBN 1558607927. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. B. Briscoe et. al. Policing Congestion Response in an Internetwork using Re-feedback. In Proc. SIGCOMM 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Datacenter TCP, http://www.stanford.edu/~alizade/Site/DCTCP.htmGoogle ScholarGoogle Scholar
  5. Nandita Dukkipati. RCP: Congestion Control to Make Flows Complete Quickly. PhD Thesis, Department of Electrical Engineering, Stanford University, October 2006.Google ScholarGoogle Scholar
  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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. S. Floyd. RFC 3649: HighSpeed TCP for large congestion windows. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. S. Floyd and V. Jacobson. Random early detection gateways for congestion avoidance. IEEE/ACM Transactions on Networking, 1(4):397--413, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. S. Floyd and V. Jacobson. The synchronization of periodic routing messages. IEEE/ACM Transactions on Networking, 2(2):122--136, 1994. Google ScholarGoogle ScholarDigital LibraryDigital 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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Y. Gu, D. Towsley, C. Hollot, and H. Zhang. Congestion control for small buffer high bandwidth networks. In Proc. INFOCOM, 2007.Google ScholarGoogle Scholar
  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.Google ScholarGoogle Scholar
  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.Google ScholarGoogle Scholar
  14. S. Iyer et. al. Analysis of a memory architecture for fast packet buffers. In IEEE HPSR Workshop, 2001.Google ScholarGoogle Scholar
  15. D. Katabi, M. Handley, and C. Rohrs. Congestion Control for High Bandwidth-Delay Product Networks. In Proc. SIGCOMM, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Sam Liang and David Cheriton. TCP-RTM: Using TCP for Real Time Applications. In Proc. ICNP, 2002.Google ScholarGoogle Scholar
  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. Google ScholarGoogle ScholarDigital LibraryDigital 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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. The ns-3 discrete-event network simulator. http://www.nsnam.org/Google ScholarGoogle Scholar
  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.pdfGoogle ScholarGoogle Scholar
  21. K. Ramakrishnan, S. Floyd, and D. Black. RFC 3168: The addition of explicit congestion notification (ECN) to IP. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. I. R. Sangtae Ha and L. Xu. Cubic: A new TCP-friendly high-speed TCP variant. In Proc. SIGOPS-OSR, 2008. Google ScholarGoogle ScholarDigital LibraryDigital 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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. V. Vasudevan et al. Safe and effective fine-grained TCP retransmissions for datacenter communication. In Proc. SIGCOMM, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. C. Wilson, H. Ballani, T. Karagiannis, A. Rowstron. Better Never Than Late: Meeting Deadlines in Datacenter Networks. In Proc. SIGCOMM, 2011. Google ScholarGoogle ScholarDigital LibraryDigital 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.Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Y. Xia, L. Subramanian, I. Stoica, and S. Kalyanaraman. One more bit is enough. In Proc. SIGCOMM, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Deadline-aware datacenter tcp (D2TCP)

    Recommendations

    Comments

    Login options

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

    Sign in
    • 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

      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]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 13 August 2012

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      Overall Acceptance Rate554of3,547submissions,16%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader