research-article

Better never than late: meeting deadlines in datacenter networks

Authors:

Christo Wilson,

Hitesh Ballani,

Thomas Karagiannis,

Ant RowtronAuthors Info & Claims

ACM SIGCOMM Computer Communication Review, Volume 41, Issue 4

Pages 50 - 61

https://doi.org/10.1145/2043164.2018443

Published: 15 August 2011 Publication History

Abstract

The soft real-time nature of large scale web applications in today's datacenters, combined with their distributed workflow, leads to deadlines being associated with the datacenter application traffic. A network flow is useful, and contributes to application throughput and operator revenue if, and only if, it completes within its deadline. Today's transport pro- tocols (TCP included), given their Internet origins, are agnostic to such flow deadlines. Instead, they strive to share network resources fairly. We show that this can hurt application performance.

Motivated by these observations, and other (previously known) deficiencies of TCP in the datacenter environment, this paper presents the design and implementation of D3, a deadline-aware control protocol that is customized for the datacenter environment. D3 uses explicit rate control to apportion bandwidth according to flow deadlines. Evaluation from a 19-node, two-tier datacenter testbed shows that D3, even without any deadline information, easily outper- forms TCP in terms of short flow latency and burst tolerance. Further, by utilizing deadline information, D3 effectively doubles the peak load that the datacenter network cansupport.

Supplementary Material

JPG File (sigcomm_2_2.jpg)

Download
12.21 KB

MP4 File (sigcomm_2_2.mp4)

Download
111.05 MB

References

[1]

H. Abu-Libdeh, P. Costa, A. Rowstron, G. O'Shea, and A. Donnelly. Symbiotic routing in future data centers. In ACM SIGCOMM, 2010.

Digital Library

[2]

M. Al-Fares, A. Loukissas, and A. Vahdat. A Scalable, Commodity Data Center Network Architecture. In Proc. of ACM SIGCOMM, 2008.

Digital Library

[3]

M. Alizadeh, B. Atikoglu, A. Kabbani, A. Laksmikantha, R. Pan, B. Prabhakar, and M. Seaman. Data center transport mechanisms: congestion control theory and IEEE standardization. In Proc. of Allerton Conference on Communications, Control and Computing, Sept. 2008.

[4]

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

Digital Library

[5]

C. Aras, J. Kurose, D. Reeves, and H. Schulzrinne. Real-time communication in packet-switched networks. Proc.of the IEEE, 82(1), 1994.

[6]

D. Beaver, S. Kumar, H. C. Li, J. Sobel, and P. Vajgel. Finding a Needle in Haystack: Facebook's Photo Storage. In Proc. of OSDI, 2010.

Digital Library

[7]

B. B. Chen and P.-B. Primet. Scheduling deadline-constrained bulk data transfers to minimize network congestion. In CCGRID, May 2007.

Digital Library

[8]

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

Digital Library

[9]

J. Dean and S. Ghemawat. MapReduce: Simplified Data Processing on Large Clusters. In USENIX OSDI, 2004.

Digital Library

[10]

G. DeCandia, D. Hastorun, M. Jampani, G. Kakulapati, A. Lakshman, A. Pilchin, S. Sivasubramanian, P. Vosshall, and W. Vogels. Dynamo: amazon's highly available key-value store. ACM SIGOPS, 41(6), 2007.

Digital Library

[11]

N. Dukkipati. Rate Control Protocol (RCP): Congestion control to make flows complete quickly. PhD thesis, Stanford University, 2007.

Digital Library

[12]

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

Digital Library

[13]

A. Greenberg, J. R. Hamilton, N. Jain, S. Kandula, C. Kim, P. Lahiri, D. A. Maltz, P. Patel, and S. Sengupta. VL2: a scalable and flexible data center network. In Proc. of ACM SIGCOMM, 2009.

Digital Library

[14]

Y. Gu, C. V. Hollot, and H. Zhang. Congestion Control for Small Buffer High Speed Networks. In Proc. of IEEE INFOCOM, 2007.

Digital Library

[15]

C. Guo, H. Wu, K. Tan, L. Shi, Y. Zhang, and S. Lu. Dcell: a scalable and fault-tolerant network structure for data centers. In Proc. of ACM SIGCOMM, 2008.

Digital Library

[16]

T. Hoff. 10 eBay Secrets for Planet Wide Scaling, Nov. 2009. http://highscalability.com/blog/2009/11/17/10-ebay-secrets-for-planet-wide-scaling.html.

[17]

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

[18]

M. Isard, M. Budiu, Y. Yu, A. Birrell, and D. Fetterly. Dryad: Distributed Data-Parallel Programs from Sequential Building Blocks. In Proc. of EuroSys, Mar. 2007.

Digital Library

[19]

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

Digital Library

[20]

R. Kohavi, R. Longbotham, D. Sommerfield, and R. M. Henne. Controlled experiments on the web: survey and practical guide. Data Mining and Knowledge Discovery, 18(1), 2009.

Digital Library

[21]

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

[22]

P. Saab. Scaling memcached at Facebook, Dec. 2008. http://www.facebook.com/note.php?note_id=39391378919.

[23]

V. Vasudevan, A. Phanishayee, H. Shah, E. Krevat, D. G. Andersen, G. R. Ganger, G. A. Gibson, and B. Mueller. Safe and effective fine-grained TCP retransmissions for datacenter communication. In ACM SIGCOMM, 2009.

Digital Library

[24]

W. Vogels. Performance and Scalability, Apr. 2009. http://www.thingsdistributed.com/2006/04/performance_and_scalability.html.

[25]

M. Welsh, D. Culler, and E. Brewer. Seda: an architecture for well-conditioned, scalable internet services. In Proc. of ACM SOSP, 2001.

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

Cited By

Jang YKim S(2024)Understanding Mobile OTT Service Users’ Resistance to Participation in Wireless D2D Caching NetworksBehavioral Sciences10.3390/bs1403015814:3(158)Online publication date: 21-Feb-2024
https://doi.org/10.3390/bs14030158
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
Elbediwy MPontikakis BGhaffari ADavid JSavaria Y(2024)DR-PIFO: A Dynamic Ranking Packet Scheduler Using a Push-In-First-Out QueueIEEE Transactions on Network and Service Management10.1109/TNSM.2023.330489421:1(355-371)Online publication date: 1-Feb-2024
https://dl.acm.org/doi/10.1109/TNSM.2023.3304894
Show More Cited By

Index Terms

Better never than late: meeting deadlines in datacenter networks
1. Networks
  1. Network protocols

Recommendations

Better never than late: meeting deadlines in datacenter networks
SIGCOMM '11: Proceedings of the ACM SIGCOMM 2011 conference

The soft real-time nature of large scale web applications in today's datacenters, combined with their distributed workflow, leads to deadlines being associated with the datacenter application traffic. A network flow is useful, and contributes to ...
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., ...
Deadline-aware datacenter tcp (D2TCP)
SIGCOMM '12: Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication

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

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM SIGCOMM Computer Communication Review

ACM SIGCOMM Computer Communication Review Volume 41, Issue 4

SIGCOMM '11

August 2011

480 pages

ISSN:0146-4833

DOI:10.1145/2043164

Issue’s Table of Contents

SIGCOMM '11: Proceedings of the ACM SIGCOMM 2011 conference
August 2011
502 pages
ISBN:9781450307970
DOI:10.1145/2018436
General Chairs:
Srinivasan Keshav
University of Waterloo, Canada
,
Jörg Liebeherr
University of Toronto, Canada
,
Program Chairs:
John Byers
Boston University, USA
,
Jeffrey Mogul
HP Labs, USA

Copyright © 2011 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: 15 August 2011

Published in SIGCOMM-CCR Volume 41, Issue 4

Check for updates

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

550
Total Citations
View Citations
3,126
Total Downloads

Downloads (Last 12 months)231
Downloads (Last 6 weeks)27

Reflects downloads up to 22 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Jang YKim S(2024)Understanding Mobile OTT Service Users’ Resistance to Participation in Wireless D2D Caching NetworksBehavioral Sciences10.3390/bs1403015814:3(158)Online publication date: 21-Feb-2024
https://doi.org/10.3390/bs14030158
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
Elbediwy MPontikakis BGhaffari ADavid JSavaria Y(2024)DR-PIFO: A Dynamic Ranking Packet Scheduler Using a Push-In-First-Out QueueIEEE Transactions on Network and Service Management10.1109/TNSM.2023.330489421:1(355-371)Online publication date: 1-Feb-2024
https://dl.acm.org/doi/10.1109/TNSM.2023.3304894
Xu JPan WTan HCheng L(2024)A TCP Congestion Control Optimization Method for SDN-Based Data Center Networks2024 9th International Conference on Computer and Communication Systems (ICCCS)10.1109/ICCCS61882.2024.10603010(468-473)Online publication date: 19-Apr-2024
https://doi.org/10.1109/ICCCS61882.2024.10603010
Liu YYu TMeng QLiu Q(2024)Flow optimization strategies in data center networks: A surveyJournal of Network and Computer Applications10.1016/j.jnca.2024.103883226(103883)Online publication date: Jun-2024
https://doi.org/10.1016/j.jnca.2024.103883
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
Song JLiu JGao PLiu GChao H(2024)Inversion impact of approximate PIFO to Start-Time Fair QueueingComputer Networks10.1016/j.comnet.2023.110164240(110164)Online publication date: Feb-2024
https://doi.org/10.1016/j.comnet.2023.110164
Vesilo R(2024)Core allocation to minimize total flow time in a multicore system in the presence of a processing time constraintQueueing Systems10.1007/s11134-024-09923-0Online publication date: 26-Aug-2024
https://doi.org/10.1007/s11134-024-09923-0
Tseng SHan SWierman A(2023)Trading Throughput for Freshness: Freshness-aware Traffic Engineering and In-Network Freshness ControlACM Transactions on Modeling and Performance Evaluation of Computing Systems10.1145/35769198:1-2(1-26)Online publication date: 7-Mar-2023
https://dl.acm.org/doi/10.1145/3576919
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
Show More Cited By

View Options

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

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents