{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T14:31:45Z","timestamp":1775745105309,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,8,27]],"date-time":"2013-08-27T00:00:00Z","timestamp":1377561600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,8,27]]},"DOI":"10.1145\/2486001.2486031","type":"proceedings-article","created":{"date-parts":[[2013,8,13]],"date-time":"2013-08-13T08:31:21Z","timestamp":1376382681000},"page":"435-446","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":400,"title":["pFabric"],"prefix":"10.1145","author":[{"given":"Mohammad","family":"Alizadeh","sequence":"first","affiliation":[{"name":"Stanford University \/ Insieme Networks, Stanford, CA, USA"}]},{"given":"Shuang","family":"Yang","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]},{"given":"Milad","family":"Sharif","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]},{"given":"Sachin","family":"Katti","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]},{"given":"Nick","family":"McKeown","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]},{"given":"Balaji","family":"Prabhakar","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]},{"given":"Scott","family":"Shenker","sequence":"additional","affiliation":[{"name":"U.C. Berkeley \/ ICSI, Berkeley, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2013,8,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402967"},{"key":"e_1_3_2_1_2_1","volume-title":"Proc. of NSDI","author":"Al-Fares M.","year":"2010","unstructured":"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 . 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."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851192"},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. of NSDI","author":"Alizadeh M.","year":"2012","unstructured":"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 . 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."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2390231.2390254"},{"key":"e_1_3_2_1_6_1","unstructured":"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.  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."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2254756.2254766"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/378420.378792"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1106"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/378420.378438"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6567015"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592576"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","DOI":"10.1002\/9781118625651","volume-title":"Fundamentals of Queueing Theory","author":"Gross D.","year":"2008","unstructured":"D. Gross , J. F. Shortle , J. M. Thompson , and C. M. Harris . Fundamentals of Queueing Theory . Wiley-Interscience , New York, NY, USA , 4 th edition, 2008 . 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.","edition":"4"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2342356.2342389"},{"key":"e_1_3_2_1_15_1","unstructured":"The Network Simulator NS-2. http:\/\/www.isi.edu\/nsnam\/ns\/.  The Network Simulator NS-2. http:\/\/www.isi.edu\/nsnam\/ns\/."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1965724.1965751"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018467"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2342356.2342388"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592604"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2005.07.008"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018443"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2342356.2342390"}],"event":{"name":"SIGCOMM'13: ACM SIGCOMM 2013 Conference","location":"Hong Kong China","acronym":"SIGCOMM'13","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2486001.2486031","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2486001.2486031","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:48:40Z","timestamp":1750222120000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2486001.2486031"}},"subtitle":["minimal near-optimal datacenter transport"],"short-title":[],"issued":{"date-parts":[[2013,8,27]]},"references-count":22,"alternative-id":["10.1145\/2486001.2486031","10.1145\/2486001"],"URL":"https:\/\/doi.org\/10.1145\/2486001.2486031","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2534169.2486031","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,8,27]]},"assertion":[{"value":"2013-08-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}