pFabric: Minimal Near-Optimal Datacenter Transport. Alizadeh, M., Yang, S., Sharif, M., & Katti, S. In ACM SIGCOMM, volume 43, pages 435–446, New York, New York, USA, 2013. ACM. Issue: 4 ISSN: 0146-4833Paper doi abstract bibtex 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.
@inproceedings{alizadeh_pfabric:_2013,
address = {New York, New York, USA},
title = {{pFabric}: {Minimal} {Near}-{Optimal} {Datacenter} {Transport}},
volume = {43},
isbn = {978-1-4503-2056-6},
url = {http://dl.acm.org/citation.cfm?doid=2486001.2486031},
doi = {10/gf8t64},
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.},
urldate = {2017-02-27},
booktitle = {{ACM} {SIGCOMM}},
publisher = {ACM},
author = {Alizadeh, Mohammad and Yang, Shuang and Sharif, Milad and Katti, Sachin},
year = {2013},
note = {Issue: 4
ISSN: 0146-4833},
pages = {435--446}
}
Downloads: 0
{"_id":"bZet2EsTW47TQ2TrZ","bibbaseid":"alizadeh-yang-sharif-katti-pfabricminimalnearoptimaldatacentertransport-2013","authorIDs":[],"author_short":["Alizadeh, M.","Yang, S.","Sharif, M.","Katti, S."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","address":"New York, New York, USA","title":"pFabric: Minimal Near-Optimal Datacenter Transport","volume":"43","isbn":"978-1-4503-2056-6","url":"http://dl.acm.org/citation.cfm?doid=2486001.2486031","doi":"10/gf8t64","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.","urldate":"2017-02-27","booktitle":"ACM SIGCOMM","publisher":"ACM","author":[{"propositions":[],"lastnames":["Alizadeh"],"firstnames":["Mohammad"],"suffixes":[]},{"propositions":[],"lastnames":["Yang"],"firstnames":["Shuang"],"suffixes":[]},{"propositions":[],"lastnames":["Sharif"],"firstnames":["Milad"],"suffixes":[]},{"propositions":[],"lastnames":["Katti"],"firstnames":["Sachin"],"suffixes":[]}],"year":"2013","note":"Issue: 4 ISSN: 0146-4833","pages":"435–446","bibtex":"@inproceedings{alizadeh_pfabric:_2013,\n\taddress = {New York, New York, USA},\n\ttitle = {{pFabric}: {Minimal} {Near}-{Optimal} {Datacenter} {Transport}},\n\tvolume = {43},\n\tisbn = {978-1-4503-2056-6},\n\turl = {http://dl.acm.org/citation.cfm?doid=2486001.2486031},\n\tdoi = {10/gf8t64},\n\tabstract = {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.},\n\turldate = {2017-02-27},\n\tbooktitle = {{ACM} {SIGCOMM}},\n\tpublisher = {ACM},\n\tauthor = {Alizadeh, Mohammad and Yang, Shuang and Sharif, Milad and Katti, Sachin},\n\tyear = {2013},\n\tnote = {Issue: 4\nISSN: 0146-4833},\n\tpages = {435--446}\n}\n\n","author_short":["Alizadeh, M.","Yang, S.","Sharif, M.","Katti, S."],"key":"alizadeh_pfabric:_2013","id":"alizadeh_pfabric:_2013","bibbaseid":"alizadeh-yang-sharif-katti-pfabricminimalnearoptimaldatacentertransport-2013","role":"author","urls":{"Paper":"http://dl.acm.org/citation.cfm?doid=2486001.2486031"},"downloads":0},"bibtype":"inproceedings","biburl":"https://bibbase.org/zotero/k4rtik","creationDate":"2020-05-31T17:07:22.535Z","downloads":0,"keywords":[],"search_terms":["pfabric","minimal","near","optimal","datacenter","transport","alizadeh","yang","sharif","katti"],"title":"pFabric: Minimal Near-Optimal Datacenter Transport","year":2013,"dataSources":["Z5Dp3qAJiMzxtvKMq"]}