{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T17:08:33Z","timestamp":1790788113390,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,11,9]],"date-time":"2016-11-09T00:00:00Z","timestamp":1478649600000},"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":[[2016,11,9]]},"DOI":"10.1145\/3005745.3005760","type":"proceedings-article","created":{"date-parts":[[2016,11,2]],"date-time":"2016-11-02T08:22:17Z","timestamp":1478074937000},"page":"92-98","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":57,"title":["Deadlocks in Datacenter Networks"],"prefix":"10.1145","author":[{"given":"Shuihai","family":"Hu","sequence":"first","affiliation":[{"name":"HKUST"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yibo","family":"Zhu","sequence":"additional","affiliation":[{"name":"Microsoft"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peng","family":"Cheng","sequence":"additional","affiliation":[{"name":"Microsoft"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chuanxiong","family":"Guo","sequence":"additional","affiliation":[{"name":"Microsoft"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kun","family":"Tan","sequence":"additional","affiliation":[{"name":"Microsoft"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jitendra","family":"Padhye","sequence":"additional","affiliation":[{"name":"Microsoft"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kai","family":"Chen","sequence":"additional","affiliation":[{"name":"HKUST"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2016,11,9]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"RDMA over Converged Ethernet (RoCE). http:\/\/www.mellanox.com\/page\/products_dyn?product_family=79.  RDMA over Converged Ethernet (RoCE). http:\/\/www.mellanox.com\/page\/products_dyn?product_family=79."},{"key":"e_1_3_2_1_2_1","volume-title":"Priority-based flow control","author":"IEEE.","year":"2011","unstructured":"IEEE. 802.11qbb. Priority-based flow control , 2011 . IEEE. 802.11qbb. Priority-based flow control, 2011."},{"key":"e_1_3_2_1_3_1","volume-title":"Proc. of SIGCOMM","author":"Hussam","year":"2010","unstructured":"Hussam Abu-Libdeh et al. Symbiotic routing in future data centers . In Proc. of SIGCOMM , 2010 . Hussam Abu-Libdeh et al. Symbiotic routing in future data centers. In Proc. of SIGCOMM, 2010."},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. of NSDI","author":"Mohammad","year":"2012","unstructured":"Mohammad Alizadeh et al. Less is more: Trading a little bandwidth for ultra-low latency in the data center . In Proc. of NSDI , 2012 . Mohammad Alizadeh et al. 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","volume-title":"Deadlock-free message routing in multiprocessor interconnection networks. C-36(5): 547-553, may","author":"Dally W.J.","year":"1987","unstructured":"W.J. Dally and C. L. Seitz . Deadlock-free message routing in multiprocessor interconnection networks. C-36(5): 547-553, may 1987 . W.J. Dally and C. L. Seitz. Deadlock-free message routing in multiprocessor interconnection networks. C-36(5):547-553, may 1987."},{"key":"e_1_3_2_1_6_1","volume-title":"Proc. of NSDI","author":"Dragojevic Aleksandar","year":"2014","unstructured":"Aleksandar Dragojevic , Dushyanth Narayanan , Orion Hodson , and Miguel Castro . FaRM : Fast remote memory . In Proc. of NSDI , 2014 . Aleksandar Dragojevic, Dushyanth Narayanan, Orion Hodson, and Miguel Castro. FaRM: Fast remote memory. In Proc. of NSDI, 2014."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2011.190"},{"key":"e_1_3_2_1_8_1","volume-title":"Flow control: A comparative survey","author":"Gerla Mario","year":"1980","unstructured":"Mario Gerla and Leonard Kleinrock . Flow control: A comparative survey . IEEE Transactions on Communications , 1980 . Mario Gerla and Leonard Kleinrock. Flow control: A comparative survey. IEEE Transactions on Communications, 1980."},{"key":"e_1_3_2_1_9_1","volume-title":"Proc. of SIGCOMM","author":"Chuanxiong","year":"2009","unstructured":"Chuanxiong Guo et al. BCube: a high performance, server-centric network architecture for modular data centers . In Proc. of SIGCOMM , 2009 . Chuanxiong Guo et al. BCube: a high performance, server-centric network architecture for modular data centers. In Proc. of SIGCOMM, 2009."},{"key":"e_1_3_2_1_10_1","volume-title":"Proc. of SIGCOMM","author":"Chuanxiong","year":"2016","unstructured":"Chuanxiong Guo et al. RDMA over commodity ethernet at scale . In Proc. of SIGCOMM , 2016 . Chuanxiong Guo et al. RDMA over commodity ethernet at scale. In Proc. of SIGCOMM, 2016."},{"key":"e_1_3_2_1_11_1","volume-title":"Proc. of IPDPS","author":"Jian","year":"2012","unstructured":"Jian Huang et al. High-performance design of hbase with rdma over infiniband . In Proc. of IPDPS , 2012 . Jian Huang et al. High-performance design of hbase with rdma over infiniband. In Proc. of IPDPS, 2012."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626307"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626299"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.820434"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2013.78"},{"key":"e_1_3_2_1_16_1","volume-title":"Proc. of ATC","author":"Mitchell Christopher","year":"2013","unstructured":"Christopher Mitchell , Yifeng Geng , and Jinyang Li . Using one-sided rdma reads to build a fast, cpu-efficient key-value store . In Proc. of ATC , 2013 . Christopher Mitchell, Yifeng Geng, and Jinyang Li. Using one-sided rdma reads to build a fast, cpu-efficient key-value store. In Proc. of ATC, 2013."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787510"},{"key":"e_1_3_2_1_18_1","volume-title":"An effective methodology to improve the performance of the up*\/down* routing algorithm","author":"Sancho Jose Carlos","unstructured":"Jose Carlos Sancho , Antonio Robles , and Jose Duato . An effective methodology to improve the performance of the up*\/down* routing algorithm . IEEE Transactions on Parallel and Distributed Systems . Jose Carlos Sancho, Antonio Robles, and Jose Duato. An effective methodology to improve the performance of the up*\/down* routing algorithm. IEEE Transactions on Parallel and Distributed Systems."},{"key":"e_1_3_2_1_19_1","volume-title":"Proc. of NSDI","author":"Singla Ankit","year":"2012","unstructured":"Ankit Singla , Chi-Yao Hong , Lucian Popa , and P. Brighten Godfrey . Jellyfish: Networking data centers randomly . In Proc. of NSDI , 2012 . Ankit Singla, Chi-Yao Hong, Lucian Popa, and P. Brighten Godfrey. Jellyfish: Networking data centers randomly. In Proc. of NSDI, 2012."},{"key":"e_1_3_2_1_20_1","volume-title":"Prof. of IPDPS","author":"Skeie Tor","year":"2012","unstructured":"Tor Skeie , Olav Lysne , and Ingebj\u00f8rg Theiss . Layered shortest path (lash) routing in irregular system area networks . In Prof. of IPDPS , 2012 . Tor Skeie, Olav Lysne, and Ingebj\u00f8rg Theiss. Layered shortest path (lash) routing in irregular system area networks. In Prof. of IPDPS, 2012."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848121"},{"key":"e_1_3_2_1_22_1","volume-title":"A fault-tolerant and deadlock-free routing protocol in 2D meshes based on odd-even turn model","author":"Wu Jie","unstructured":"Jie Wu . A fault-tolerant and deadlock-free routing protocol in 2D meshes based on odd-even turn model . IEEE Transactions on Computers . Jie Wu. A fault-tolerant and deadlock-free routing protocol in 2D meshes based on odd-even turn model. IEEE Transactions on Computers."},{"key":"e_1_3_2_1_23_1","volume-title":"Proc. of NSDI","author":"Zeng Hongyi","year":"2014","unstructured":"Hongyi Zeng , Shidong Zhang , Fei Ye , Vimalkumar Jeyakumar , Mickey Ju , Junda Liu , Nick McKeown , and Amin Vahdat . Libra : Divide and conquer to verify forwarding tables in huge networks . In Proc. of NSDI , 2014 . Hongyi Zeng, Shidong Zhang, Fei Ye, Vimalkumar Jeyakumar, Mickey Ju, Junda Liu, Nick McKeown, and Amin Vahdat. Libra: Divide and conquer to verify forwarding tables in huge networks. In Proc. of NSDI, 2014."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787484"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787483"}],"event":{"name":"HotNets-XV: The 15th ACM Workshop on Hot Topics in Networks","location":"Atlanta GA USA","acronym":"HotNets-XV","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the 15th ACM Workshop on Hot Topics in Networks"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3005745.3005760","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3005745.3005760","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:39:38Z","timestamp":1750203578000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3005745.3005760"}},"subtitle":["Why Do They Form, and How to Avoid Them"],"short-title":[],"issued":{"date-parts":[[2016,11,9]]},"references-count":25,"alternative-id":["10.1145\/3005745.3005760","10.1145\/3005745"],"URL":"https:\/\/doi.org\/10.1145\/3005745.3005760","relation":{},"subject":[],"published":{"date-parts":[[2016,11,9]]},"assertion":[{"value":"2016-11-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}