research-article

Free access

pFabric: minimal near-optimal datacenter transport

Authors:

Mohammad Alizadeh,

Balaji Prabhakar,

Scott ShenkerAuthors Info & Claims

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

Pages 435 - 446

https://doi.org/10.1145/2486001.2486031

Published: 27 August 2013 Publication History

Abstract

In this paper we present pFabric, a minimalistic datacenter transport design that provides near theoretically optimal flow completion times even at the 99th percentile for short flows, while still minimizing average flow completion time for long flows. Moreover, pFabric delivers this performance with a very simple design that is based on a key conceptual insight: datacenter transport should decouple flow scheduling from rate control. For flow scheduling, packets carry a single priority number set independently by each flow; switches have very small buffers and implement a very simple priority-based scheduling/dropping mechanism. Rate control is also correspondingly simpler; flows start at line rate and throttle back only under high and persistent packet loss. We provide theoretical intuition and show via extensive simulations that the combination of these two simple mechanisms is sufficient to provide near-optimal performance.

References

[1]

M. Al-Fares, A. Loukissas, and A. Vahdat. A scalable, commodity data center network architecture. In Proc. of SIGCOMM, 2008.

Digital Library

[2]

M. Al-Fares, S. Radhakrishnan, B. Raghavan, N. Huang, and A. Vahdat. Hedera: dynamic flow scheduling for data center networks. In Proc. of NSDI, 2010.

Digital Library

[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. 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. of NSDI, 2012.

Digital Library

[5]

M. Alizadeh, S. Yang, S. Katti, N. McKeown, B. Prabhakar, and S. Shenker. Deconstructing datacenter packet transport. In Proc. of HotNets, 2012.

Digital Library

[6]

M. Alizadeh, S. Yang, M. Sharif, S. Katti, N. McKeown, B. Prabhakar, and S. Shenker. pFabric: Minimal Near-Optimal Datacenter Transport. http://simula.stanford.edu/ alizade/pfabric-techreport.pdf.

[7]

B. Atikoglu, Y. Xu, E. Frachtenberg, S. Jiang, and M. Paleczny. Workload analysis of a large-scale key-value store. In Proc. of SIGMETRICS, 2012.

Digital Library

[8]

N. Bansal and M. Harchol-Balter. Analysis of SRPT scheduling: investigating unfairness. In Proc. of SIGMETRICS, 2001.

Digital Library

[9]

A. Bar-Noy, M. M. Halldórsson, G. Kortsarz, R. Salman, and H. Shachnai. Sum multicoloring of graphs. J. Algorithms, 2000.

Digital Library

[10]

T. Bonald and L. Massoulié. Impact of fairness on Internet performance. In Proc. of SIGMETRICS, 2001.

Digital Library

[11]

A. Dixit, P. Prakash, Y. C. Hu, and R. R. Kompella. On the Impact of Packet Spraying in Data Center Networks. In Proc. of INFOCOM, 2013.

[12]

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

Digital Library

[13]

D. Gross, J. F. Shortle, J. M. Thompson, and C. M. Harris. Fundamentals of Queueing Theory. Wiley-Interscience, New York, NY, USA, 4th edition, 2008.

Digital Library

[14]

C.-Y. Hong, M. Caesar, and P. B. Godfrey. Finishing Flows Quickly with Preemptive Scheduling. In Proc. of SIGCOMM, 2012.

Digital Library

[15]

The Network Simulator NS-2. http://www.isi.edu/nsnam/ns/.

[16]

J. Ousterhout, P. Agrawal, D. Erickson, C. Kozyrakis, J. Leverich, D. Mazières, S. Mitra, A. Narayanan, D. Ongaro, G. Parulkar, M. Rosenblum, S. M. Rumble, E. Stratmann, and R. Stutsman. The case for RAMCloud. Commun. ACM, 2011.

Digital Library

[17]

C. Raiciu, S. Barre, C. Pluntke, A. Greenhalgh, D. Wischik, and M. Handley. Improving datacenter performance and robustness with multipath TCP. In Proc. of the SIGCOMM, 2011.

Digital Library

[18]

B. Vamanan, J. Hasan, and T. N. Vijaykumar. Deadline-Aware Datacenter TCP (D2TCP). In Proc. of SIGCOMM, 2012.

Digital Library

[19]

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 Proc. of SIGCOMM, 2009.

Digital Library

[20]

M. Verloop, S. Borst, and R. Núnez Queija. Stability of size-based scheduling disciplines in resource-sharing networks. Perform. Eval., 62(1--4), 2005.

Digital Library

[21]

C. Wilson, H. Ballani, T. Karagiannis, and A. Rowtron. Better never than late: meeting deadlines in datacenter networks. In Proc. of SIGCOMM, 2011.

Digital Library

[22]

D. Zats, T. Das, P. Mohan, D. Borthakur, and R. H. Katz. DeTail: Reducing the Flow Completion Time Tail in Datacenter Networks. In Proc. of SIGCOMM, 2012.

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
Zhang ZChen SYao RSun RMei HWang HChen ZFang GFan YShi WLiu SXu YSekar VYu MSeneviratne AVeitch D(2024)vPIFO: Virtualized Packet Scheduler for Programmable Hierarchical Scheduling in High-Speed NetworksProceedings of the ACM SIGCOMM 2024 Conference10.1145/3651890.3672270(983-999)Online publication date: 4-Aug-2024
https://dl.acm.org/doi/10.1145/3651890.3672270
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
Show More Cited By

Index Terms

pFabric: minimal near-optimal datacenter transport
1. Networks
  1. Network architectures

Recommendations

pFabric: minimal near-optimal datacenter transport

In this paper we present pFabric, a minimalistic datacenter transport design that provides near theoretically optimal flow completion times even at the 99th percentile for short flows, while still minimizing average flow completion time for long flows. ...
Minimizing datacenter flow completion times with server-based flow scheduling

Minimizing flow completion times (FCT) is a critical issue in datacenter networks. Existing approaches either cannot minimize FCT (i.e., DCTCP) or are costly to deploy with hardware modification on switches (i.e., pFabric). This paper presents a server-...
pHost: distributed near-optimal datacenter transport over commodity network fabric
CoNEXT '15: Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies

The importance of minimizing flow completion times (FCT) in datacenters has led to a growing literature on new network transport designs. Of particular note is pFabric, a protocol that achieves near-optimal FCTs. However, pFabric's performance comes at ...

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

683
Total Citations
View Citations
3,372
Total Downloads

Downloads (Last 12 months)432
Downloads (Last 6 weeks)49

Reflects downloads up to 14 Dec 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
Zhang ZChen SYao RSun RMei HWang HChen ZFang GFan YShi WLiu SXu YSekar VYu MSeneviratne AVeitch D(2024)vPIFO: Virtualized Packet Scheduler for Programmable Hierarchical Scheduling in High-Speed NetworksProceedings of the ACM SIGCOMM 2024 Conference10.1145/3651890.3672270(983-999)Online publication date: 4-Aug-2024
https://dl.acm.org/doi/10.1145/3651890.3672270
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
Li ZLi DChen YChen KZhang Y(2024)Decentralized Scheduling for Data-Parallel Tasks in the CloudACM Transactions on Parallel Computing10.1145/365185811:2(1-23)Online publication date: 8-Jun-2024
https://dl.acm.org/doi/10.1145/3651858
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
Aljoby WWang XDivakaran DFu TMa RHarras K(2024)DiffPerf: Toward Performance Differentiation and Optimization With SDN ImplementationIEEE Transactions on Network and Service Management10.1109/TNSM.2023.329796621:1(1012-1031)Online publication date: Feb-2024
https://doi.org/10.1109/TNSM.2023.3297966
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
Zhang JZeng CZhang HHu SChen K(2024)LiteFlow: Toward High-Performance Adaptive Neural Networks for Kernel DatapathIEEE/ACM Transactions on Networking10.1109/TNET.2023.329315232:1(627-642)Online publication date: Feb-2024
https://doi.org/10.1109/TNET.2023.3293152
Zhang SSuo LLi WLiu YLi YLi K(2024)Anole: Scheduling Flows for Fast Datacenter Networks With Packet Re-PrioritizationIEEE Transactions on Cloud Computing10.1109/TCC.2024.337671612:2(550-562)Online publication date: Apr-2024
https://doi.org/10.1109/TCC.2024.3376716
Wang JZhao GXu HWang H(2024)Leaf: Improving QoS for Reconfigurable Datacenters with Multiple Optical Circuit Switches2024 IEEE/ACM 32nd International Symposium on Quality of Service (IWQoS)10.1109/IWQoS61813.2024.10682931(1-10)Online publication date: 19-Jun-2024
https://doi.org/10.1109/IWQoS61813.2024.10682931
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