{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:17:20Z","timestamp":1763468240870,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,10,20]],"date-time":"2014-10-20T00:00:00Z","timestamp":1413763200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100007472","name":"University of Kentucky","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007472","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,10,20]]},"DOI":"10.1145\/2658260.2658266","type":"proceedings-article","created":{"date-parts":[[2014,10,21]],"date-time":"2014-10-21T12:59:05Z","timestamp":1413896345000},"page":"53-64","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["DiFS"],"prefix":"10.1145","author":[{"given":"Wenzhi","family":"Cui","sequence":"first","affiliation":[{"name":"The University of Texas at Austin, Austin, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"Qian","sequence":"additional","affiliation":[{"name":"University of Kentucky, Lexington, KY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,10,20]]},"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":"Proceedings of USENIX 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 Proceedings of USENIX NSDI , 2010 . M. Al-Fares, S. Radhakrishnan, B. Raghavan, N. Huang, and A. Vahdat. Hedera: dynamic flow scheduling for data center networks. In Proceedings of USENIX NSDI, 2010."},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of ACM SIGCOMM","author":"Alizadeh M.","year":"2010","unstructured":"M. Alizadeh , A. Greenberg , D. A. Maltz , J. Padhye , P. Patel , B. Prabhakar , S. Sengupta , and M. Sridharan . Dctcp: Efficient packet transport for the commoditized data center . In Proceedings of ACM SIGCOMM , 2010 . M. Alizadeh, A. Greenberg, D. A. Maltz, J. Padhye, P. Patel, B. Prabhakar, S. Sengupta, and M. Sridharan. Dctcp: Efficient packet transport for the commoditized data center. In Proceedings of ACM SIGCOMM, 2010."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018465"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879175"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2079296.2079304"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018448"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6567015"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018504"},{"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\/1397718.1397732"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402968"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592577"},{"key":"e_1_3_2_1_15_1","first-page":"2992","author":"Hopps C.","year":"2000","unstructured":"C. Hopps . Analysis of an equal-cost multi-path algorithm. RFC 2992 , 2000 . C. Hopps. Analysis of an equal-cost multi-path algorithm. RFC 2992, 2000.","journal-title":"RFC"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080122"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1644893.1644918"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2007.1011"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355746"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592575"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535372.2535397"},{"key":"e_1_3_2_1_22_1","volume-title":"Proc. of USENIX NSDI","author":"Singla A.","year":"2012","unstructured":"A. Singla , C.-Y. Hong , L. Popa , and P. B. Godfrey . Jellyfish: Networking data centers randomly . In Proc. of USENIX NSDI , 2012 . A. Singla, C.-Y. Hong, L. Popa, and P. B. Godfrey. Jellyfish: Networking data centers randomly. In Proc. of USENIX NSDI, 2012."},{"key":"e_1_3_2_1_23_1","volume-title":"Proc. of ACM HotNets","author":"Sinha S.","year":"2004","unstructured":"S. Sinha , S. Kandula , and D. Katabi . Harnessing tcps burstiness using flowlet switching . In Proc. of ACM HotNets , 2004 . S. Sinha, S. Kandula, and D. Katabi. Harnessing tcps burstiness using flowlet switching. In Proc. of ACM HotNets, 2004."},{"key":"e_1_3_2_1_24_1","volume-title":"Proceedings of USENIX NSDI","author":"Wischik D.","year":"2011","unstructured":"D. Wischik , C. Raiciu , A. Greenhalgh , and M. Handley . Design, implementation and evaluation of congestion control for multipath tcp . In Proceedings of USENIX NSDI , 2011 . D. Wischik, C. Raiciu, A. Greenhalgh, and M. Handley. Design, implementation and evaluation of congestion control for multipath tcp. In Proceedings of USENIX NSDI, 2011."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2012.69"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.893888"},{"key":"e_1_3_2_1_27_1","volume-title":"Proc. of USENIX NSDI","author":"Yu M.","year":"2013","unstructured":"M. Yu , L. Jose , and R. Miao . Software defined traffic measurement with opensketch . In Proc. of USENIX NSDI , 2013 . M. Yu, L. Jose, and R. Miao. Software defined traffic measurement with opensketch. In Proc. of USENIX NSDI, 2013."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396556.2396578"}],"event":{"name":"ANCS '14: Symposium on Architectures for Networking and Communications Systems","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication","SIGARCH ACM Special Interest Group on Computer Architecture","IEEE CS"],"location":"Los Angeles California USA","acronym":"ANCS '14"},"container-title":["Proceedings of the tenth ACM\/IEEE symposium on Architectures for networking and communications systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2658260.2658266","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2658260.2658266","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:19:43Z","timestamp":1750231183000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2658260.2658266"}},"subtitle":["distributed flow scheduling for adaptive routing in hierarchical data center networks"],"short-title":[],"issued":{"date-parts":[[2014,10,20]]},"references-count":28,"alternative-id":["10.1145\/2658260.2658266","10.1145\/2658260"],"URL":"https:\/\/doi.org\/10.1145\/2658260.2658266","relation":{},"subject":[],"published":{"date-parts":[[2014,10,20]]},"assertion":[{"value":"2014-10-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}