Advanced Search
DSpace@MIT

Fastpass: A Centralized “Zero-Queue” Datacenter Network

Research and Teaching Output of the MIT Community

Show simple item record

dc.contributor.author Perry, Jonathan
dc.contributor.author Ousterhout, Amy Elizabeth
dc.contributor.author Balakrishnan, Hari
dc.contributor.author Shah, Devavrat
dc.contributor.author Fugal, Hans
dc.date.accessioned 2014-06-30T17:43:10Z
dc.date.available 2014-06-30T17:43:10Z
dc.date.issued 2014-08
dc.identifier.isbn 978-1-4503-2836-4
dc.identifier.uri http://hdl.handle.net/1721.1/88141
dc.description.abstract An ideal datacenter network should provide several properties, including low median and tail latency, high utilization (throughput), fair allocation of network resources between users or applications, deadline-aware scheduling, and congestion (loss) avoidance. Current datacenter networks inherit the principles that went into the design of the Internet, where packet transmission and path selection decisions are distributed among the endpoints and routers. Instead, we propose that each sender should delegate control—to a centralized arbiter—of when each packet should be transmitted and what path it should follow. This paper describes Fastpass, a datacenter network architecture built using this principle. Fastpass incorporates two fast algorithms: the first determines the time at which each packet should be transmitted, while the second determines the path to use for that packet. In addition, Fastpass uses an efficient protocol between the endpoints and the arbiter and an arbiter replication strategy for fault-tolerant failover. We deployed and evaluated Fastpass in a portion of Facebook’s datacenter network. Our results show that Fastpass achieves high throughput comparable to current networks at a 240 reduction is queue lengths (4.35 Mbytes reducing to 18 Kbytes), achieves much fairer and consistent flow throughputs than the baseline TCP (5200 reduction in the standard deviation of per-flow throughput with five concurrent connections), scalability from 1 to 8 cores in the arbiter implementation with the ability to schedule 2.21 Terabits/s of traffic in software on eight cores, and a 2.5 reduction in the number of TCP retransmissions in a latency-sensitive service at Facebook. en_US
dc.description.sponsorship National Science Foundation (U.S.) (grant IIS-1065219) en_US
dc.description.sponsorship Irwin Mark Jacobs and Joan Klein Jacobs Presidential Fellowship en_US
dc.description.sponsorship Hertz Foundation (Fellowship) en_US
dc.language.iso en_US
dc.publisher Association for Computing Machinery en_US
dc.relation.isversionof http//dx.doi.org/10.1145/2619239.2626309
dc.rights Creative Commons Attribution-Noncommercial-Share Alike en_US
dc.rights.uri http://creativecommons.org/licenses/by-nc-sa/4.0/ en_US
dc.source Perry en_US
dc.title Fastpass: A Centralized “Zero-Queue” Datacenter Network en_US
dc.type Article en_US
dc.identifier.citation Perry, Jonathan, Amy Ousterhout, Hari Balakrishnan, Devavrat Shah, and Hans Fugal. "Fastpass: A Centralized “Zero-Queue” Datacenter Network." ACM SIGCOMM 2014, Chicago, Illinois, August 17-22, 2014, pp.307-318. en_US
dc.contributor.department Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory en_US
dc.contributor.department Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science en_US
dc.contributor.approver Balakrishnan, Hari en_US
dc.contributor.mitauthor Perry, Jonathan en_US
dc.contributor.mitauthor Ousterhout, Amy Elizabeth en_US
dc.contributor.mitauthor Balakrishnan, Hari en_US
dc.contributor.mitauthor Shah, Devavrat en_US
dc.contributor.mitauthor Fugal, Hans en_US
dc.relation.journal SIGCOMM 2014 proceedings en_US
dc.identifier.mitlicense OPEN_ACCESS_POLICY en_US
dc.eprint.version Author's final manuscript en_US
dc.type.uri http://purl.org/eprint/type/ConferencePaper en_US
eprint.status http://purl.org/eprint/status/NonPeerReviewed en_US
dspace.orderedauthors Perry, Jonathan; Ousterhout, Amy; Balakrishnan, Hari; Shah, Devavrat; Fugal, Hans en_US
dc.identifier.orcid https://orcid.org/0000-0001-6590-8392
dc.identifier.orcid https://orcid.org/0000-0002-4566-771X
dc.identifier.orcid https://orcid.org/0000-0003-0737-3259
dc.identifier.orcid https://orcid.org/0000-0002-1455-9652


Files in this item

Name Size Format
Downloadable Full Text - PDF

This item appears in the following Collection(s)

Show simple item record

Creative Commons Attribution-Noncommercial-Share Alike Except where otherwise noted, this item's license is described as Creative Commons Attribution-Noncommercial-Share Alike
Open Access