AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
Powered by AMiner. Clicking this button will take you away from SciOpen.
Home Tsinghua Science and Technology Article
PDF (4 MB)
Cite
EndNote(RIS) BibTeX
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Open Access

On Meeting Deadlines in Datacenter Networks

Department of Electrical and Computer Engineering, University of Toronto, Toronto M5S 3G4, Canada
Department of Computer Science, Hong Kong University of Science and Technology, Hongkong, China
Show Author Information

Abstract

Datacenters have become increasingly important to host a diverse range of cloud applications with mixed workloads. Traditional applications hosted by datacenters are throughput-oriented without delay requirements, but newer generations of cloud applications, such as web search, recommendations, and social networking, typically employ a tree-based Partition-Aggregate structure, which may incur bursts of traffic. As a result, flows in these applications have stringent latency requirements, i.e., flow deadlines need to be met in order to achieve a satisfactory user experience. To meet these flow deadlines, research efforts in the recent literature have attempted to redesign flow and congestion control protocols that are specific to datacenter networks. In this paper, we focus on the new array of deadline-sensitive flow control protocols, thoroughly investigate their underlying design principles, analyze the evolution of their designs, and evaluate the tradeoffs involved in their design choices.

Keywords

datacentertransport protocolsdesign principles

References

[1]
T. Hoff, Latency is everywhere and it costs you sales — How to crush it, http://highscalability.com/blog/2009/7/25/latency-is-everywhere-and-it-costs-you-sales-how-to-crush-it.html, 2012.
[2]
D. Zats, T. Das, P. Mohan, D. Borthakur, and R. Katz, DeTail: Reducing the flow completion time tail in datacenter networks, in Proc. ACM SIGCOMM, 2012.
Crossref
[3]
N. Dukkipati and N. McKeown, Why flow-completion time is the right metric for congestion control, ACM SIGCOMM Computer Communication Review, vol. 36, no. 1, pp. 59-62, Jan. 2006.
Crossref Google Scholar
[4]
H. Wu, Z. Feng, C. Guo, and Y. Zhang, ICTCP: Incast congestion control for tcp in data center networks, in Proc. CoNEXT, 2010.
Crossref
[5]
C. Wilson, H. Ballani, T. Karagiannis, and A. Rowstron, Better never than late: Meeting deadlines in datacenter networks, in Proc. ACM SIGCOMM, 2011.
Crossref
[6]
B. Vamanan, J. Hasan, and T. N. Vijaykumar, Deadline-aware datacenter TCP (D2TCP), in Proc. ACM SIGCOMM, 2012.
Crossref
[7]
C. Hong, M. Caesar, and P. Godfrey, Finishing flows quickly with preemptive scheduling, in Proc. ACM SIGCOMM, 2012.
Crossref
[8]
M. Alizadeh, S. Yang, S. Katti, N. McKeown, B. Prabhakar, and S. Shenker, Deconstructing datacenter packet transport, in Proc. ACM SIGCOMM HotNets Workshop, 2012.
Crossref
[9]
L. Xu, K. Harfoush, and I. Rhee, Binary increase congestion control (BIC) for fast long-distance networks, in Proc. IEEE INFOCOM, 2004.
[10]
S. Ha, I. Rhee, and L. Xu, CUBIC: A new tcp-friendly high-speed TCP variant, ACM SIGOPS Operating Systems Review, vol. 42, no. 5, pp. 64-74, 2008.
Crossref Google Scholar
[11]
D. Wei, C. Jin, S. Low, and S. Hegde, FAST TCP: Motivation, architecture, algorithms, performance, IEEE/ACM Trans. on Networking, vol. 14, no. 6, pp. 1246-1259, 2006.
Crossref Google Scholar
[12]
S. Floyd, HighSpeed TCP for large congestion windows, RFC 3649, 2003.
Crossref
[13]
S. Bhandarkar, S. Jain, and A. Reddy, LTCP: Improving the performance of TCP in highspeed networks, ACM SIGCOMM Computer Communication Review, vol. 36, no. 1, pp. 41-50, 2006.
Crossref Google Scholar
[14]
D. Katabi, M. Handley, and C. Rohrs, Congestion control for high bandwidth-delay product networks, in Proc. ACM SIGCOMM, 2002.
Crossref
[15]
V. Vasudevan, A. Phanishayee, H. Shah, E. Krevat, D. Andersen, G. Ganger, G. A. Gibson, and B. Mueller, Safe and effective fine-grained TCP retransmissions for datacenter communication, in Proc. ACM SIGCOMM, 2009.
Crossref
[16]
Y. Chen, R. Griffith, J. Liu, R. Katz, and A. Joseph, Understanding TCP incast throughput collapse in datacenter networks, in Proc. ACM Workshop on Research on Enterprise Networking, 2009.
Crossref
[17]
M. Alizadeh, A. Greenberg, D. Maltz, J. Padhye, P. Patel, B. Prabhakar, S. Sengupta, and M. Sridharan, Data center TCP (DCTCP), in Proc. ACM SIGCOMM, 2010.
Crossref
[18]
M. Alizadeh, A. Kabbani, T. Edsall, B. Prabhakar, A. Vahdat, and M. Yasuda, Less is more: Trading a little bandwidth for ultra-low latency in the data center, in Proc. USENIX Networked Systems Design and Implementation (NSDI), 2012.
[19]
R. Braden, D. Clark, and S. Shenker, Integrated services in the internet architecture: An overview, RFC 1633, 1994.
[20]
K. Nichols, S. Blake, F. Baker, and D. Black, Definition of the differentiated services field (DS field) in the IPv4 and IPv6 Headers, RFC 2475, 1998.
[21]
N. Bansal and M. Harchol-Balter, Analysis of SRPT scheduling: Investigating unfairness, in Proc. ACM SIGMETRICS, 2001.
Crossref
[22]
V. Sivaraman, F. M. Chiussi, and M. Gerla, End-to-end statistical delay service under GPS and EDF scheduling: A comparison study, in Proc. IEEE INFOCOM, 2001.
[23]
M. Al-Fares, S. Radhakrishnan, B. Raghavan, N. Huang, and A. Vahdat, Hedera: Dynamic flow scheduling for data center networks, in Proc. USENIX Networked Systems Design and Implementation (NSDI), 2010.
[24]
C. Raiciu, S. Barre, C. Pluntke, A. Greenhalgh, D. Wischik, and M. Handley, Improving datacenter performance and robustness with multipath TCP, in Proc. ACM SIGCOMM, 2011.
Crossref
[25]
D. Wischik, C. Raiciu, A. Greenhalgh, and M. Handley, Design, implementation and evaluation of congestion control for multipath TCP, in Proc. USENIX Networked Systems Design and Implementation (NSDI), 2011.
[26]
S. Floyd and V. Jacobson, Random early detection gateways for congestion avoidance, IEEE/ACM Trans. Networking, vol. 1, no. 4, pp. 397-413, 1993.
Crossref Google Scholar
[27]
C. Hollot, V. Misra, D. Towsley, and W. Gong, On designing improved controllers for AQM routers supporting TCP flows, in Proc. IEEE INFOCOM, 2001.
Crossref
[28]
Y. Gu, D. Towsley, C. Hollot, and H. Zhang, Congestion control for small buffer high speed networks, in Proc. IEEE INFOCOM, 2007.
Crossref
[29]
Y. Xia, L. Subramanian, I. Stoica, and S. Kalyanaraman, One more bit is enough, in Proc. ACM SIGCOMM, 2005.
Crossref
[30]
I. Qazi, T. Znati, and L. Andrew, Congestion control using efficient explicit feedback, in Proc. IEEE INFOCOM, 2009.
Crossref
[31]
K. Ramakrishnan and R. Jain, A binary feedback scheme for congestion avoidance in computer networks, ACM Trans. Computer Systems, vol. 8, no. 2, pp. 158-181, 1990.
Crossref Google Scholar
[32]
L. Brakmo and L. Peterson, TCP vegas: End to end congestion avoidance on a global internet, IEEE Journal on Selected Areas in Communications, vol. 13, no. 8, pp. 1465-1480, 1995.
Crossref Google Scholar
[33]
K. Tan, J. Song, Q. Zhang, M. Sridharan, A compound TCP approach for high-speed and long distance networks, in Proc. IEEE INFOCOM, 2006.
Crossref
[34]
D. Ferrari, A. Banerjea, and H. Zhang, Network support for multimedia a discussion of the tenet approach, Computer Networks and ISDN Systems, vol. 26, no. 10, pp. 1267-1280, 1994.
Crossref Google Scholar
[35]
S. Liang and D. Cheriton, TCP-RTM: Using TCP for real time multimedia applications, in Proc. IEEE ICNP, 2002.
[36]
C. Zhang and V. Tsaoussidis, TCP-real: Improving real-time capabilities of TCP over heterogeneous networks, in Proc. Network and Operating System Support for Digital Audio and Video (NOSSDAV), 2001.
Crossref
[37]
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.
Crossref
[38]
Cisco Nexus 5000 Series Architecture, http://www.cisco.com/en/US/prod/collateral/switches/ps9441/ps9670/white_paper_c11-462176.html, 2012.
[39]
N. McKeown, White paper: A fast switched backplane for a gigabit switched router, http://www.cs.cmu.edu/ srini/15-744/readings/McK97.pdf, 2012.
[40]
Priority flow control: Build reliable Layer 2 infrastructure, http://www.cisco.com/en/US/prod/collateral/switches/ps9441/ps9670/white_paper_c11-542809.pdf, 2012.
[41]
N. McKeown, T. Anderson, H. Balakrishnan, G. Parulkar, L. Peterson, J. Rexford, S. Shenker, and J. Turner, OpenFlow: Enabling innovation in campus networks, ACM SIGCOMM Computer Communication Review, vol. 38, no. 2, pp. 69-74, 2008.
Crossref Google Scholar
[42]
M. Ghobadi, S. Yeganeh, and Y. Ganjali, Rethinking end-to-end congestion control in software-defined networks, in Proc. ACM HotNets Workshop, 2012.
Crossref
Tsinghua Science and Technology
Volume 18 Issue 3,
June 2013
Pages 273-285
DOI: 10.1109/TST.2013.6522586
Cite this article:
Chen L, Li B, Li B. On Meeting Deadlines in Datacenter Networks. Tsinghua Science and Technology, 2013, 18(3): 273-285. https://doi.org/10.1109/TST.2013.6522586

468

Views

11

Downloads

3

Crossref

N/A

Web of Science

4

Scopus

0

CSCD

Altmetrics
Received: 26 February 2013
Accepted: 04 March 2013
Published: 03 June 2013
© The author(s) 2013
Return