{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T15:32:51Z","timestamp":1773329571781,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,12,1]],"date-time":"2015-12-01T00:00:00Z","timestamp":1448928000000},"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":[[2015,12]]},"DOI":"10.1145\/2716281.2836086","type":"proceedings-article","created":{"date-parts":[[2016,10,11]],"date-time":"2016-10-11T18:16:29Z","timestamp":1476209789000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":173,"title":["pHost"],"prefix":"10.1145","author":[{"given":"Peter X.","family":"Gao","sequence":"first","affiliation":[{"name":"University of California at Berkeley"}]},{"given":"Akshay","family":"Narayan","sequence":"additional","affiliation":[{"name":"University of California at Berkeley"}]},{"given":"Gautam","family":"Kumar","sequence":"additional","affiliation":[{"name":"University of California at Berkeley"}]},{"given":"Rachit","family":"Agarwal","sequence":"additional","affiliation":[{"name":"University of California at Berkeley"}]},{"given":"Sylvia","family":"Ratnasamy","sequence":"additional","affiliation":[{"name":"University of California at Berkeley"}]},{"given":"Scott","family":"Shenker","sequence":"additional","affiliation":[{"name":"University of California at Berkeley"}]}],"member":"320","published-online":{"date-parts":[[2015,12]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"CISCO\n  : Per packet load balancing. http:\/\/www.cisco.com\/en\/US\/docs\/ios\/12_0s\/feature\/guide\/pplb.html.  CISCO: Per packet load balancing. http:\/\/www.cisco.com\/en\/US\/docs\/ios\/12_0s\/feature\/guide\/pplb.html."},{"key":"e_1_3_2_1_2_1","volume-title":"Proc. of HotNets","author":"Agache A.","year":"2012","unstructured":"A. Agache and C. Raiciu . GRIN: Utilizing the empty half of full bisection networks . In Proc. of HotNets , 2012 . A. Agache and C. Raiciu. GRIN: Utilizing the empty half of full bisection networks. In Proc. of HotNets, 2012."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402967"},{"key":"e_1_3_2_1_4_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_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851192"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486031"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/161541.161736"},{"key":"e_1_3_2_1_8_1","volume-title":"Proc. of NSDI","author":"Bai W.","year":"2015","unstructured":"W. Bai , L. Chen , K. Chen , D. Han , C. Tian , and H. Wang . Information-agnostic flow scheduling for commodity data centers . In Proc. of NSDI , 2015 . W. Bai, L. Chen, K. Chen, D. Han, C. Tian, and H. Wang. Information-agnostic flow scheduling for commodity data centers. In Proc. of NSDI, 2015."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879175"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6567015"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592576"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2342356.2342389"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626305"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626309"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486007"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2342763.2342769"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2342356.2342388"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018443"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/SECPRI.2004.1301320"}],"event":{"name":"CoNEXT '15: Conference on emerging Networking Experiments and Technologies","location":"Heidelberg Germany","acronym":"CoNEXT '15","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2716281.2836086","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2716281.2836086","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:16:55Z","timestamp":1750227415000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2716281.2836086"}},"subtitle":["distributed near-optimal datacenter transport over commodity network fabric"],"short-title":[],"issued":{"date-parts":[[2015,12]]},"references-count":19,"alternative-id":["10.1145\/2716281.2836086","10.1145\/2716281"],"URL":"https:\/\/doi.org\/10.1145\/2716281.2836086","relation":{},"subject":[],"published":{"date-parts":[[2015,12]]},"assertion":[{"value":"2015-12-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}