{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T14:03:34Z","timestamp":1784124214548,"version":"3.55.0"},"reference-count":56,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2023,2,27]],"date-time":"2023-02-27T00:00:00Z","timestamp":1677456000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["864228"],"award-info":[{"award-number":["864228"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["438892507"],"award-info":[{"award-number":["438892507"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Meas. Anal. Comput. Syst."],"published-print":{"date-parts":[[2023,2,27]]},"abstract":"<jats:p>The performance of many cloud-based applications critically depends on the capacity of the underlying datacenter network. A particularly innovative approach to improve the throughput in datacenters is enabled by emerging optical technologies, which allow to dynamically adjust the physical network topology, both in an oblivious or demand-aware manner. However, such topology engineering, i.e., the operation and control of dynamic datacenter networks, is considered complex and currently comes with restrictions and overheads.<\/jats:p>\n          <jats:p>We present Duo, a novel demand-aware reconfigurable rack-to-rack datacenter network design realized with a simple and efficient control plane. Duo is based on the well-known de Bruijn topology (implemented using a small number of optical circuit switches) and the key observation that this topology can be enhanced using dynamic (''opportunistic'') links between its nodes.<\/jats:p>\n          <jats:p>In contrast to previous systems, Duo has several desired features: i) It makes effective use of the network capacity by supporting integrated and multi-hop routing (paths that combine both static and dynamic links). ii) It uses a work-conserving queue scheduling which enables out-of-the-box TCP support. iii) Duo employs greedy routing that is implemented using standard IP longest prefix match with small forwarding tables. And iv) during topological reconfigurations, routing tables require only local updates, making this approach ideal for dynamic networks.<\/jats:p>\n          <jats:p>We evaluate Duo in end-to-end packet-level simulations, comparing it to the state-of-the-art static and dynamic networks designs. We show that Duo provides higher throughput, shorter paths, lower flow completion times for high priority flows, and minimal packet reordering, all using existing network and transport layer protocols. We also report on a proof-of-concept implementation of Duo's control and data plane.<\/jats:p>","DOI":"10.1145\/3579449","type":"journal-article","created":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T23:50:57Z","timestamp":1677801057000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["Duo: A High-Throughput Reconfigurable Datacenter Network Using Local Routing and Control"],"prefix":"10.1145","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3137-7305","authenticated-orcid":false,"given":"Johannes","family":"Zerwas","sequence":"first","affiliation":[{"name":"Technical University of Munich, Munich, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8083-3277","authenticated-orcid":false,"given":"Csaba","family":"Gy\u00f6rgyi","sequence":"additional","affiliation":[{"name":"ELTE E\u00f6tv\u00f6s Lor\u00e1nd University &amp; University of Vienna, Budapest, Hungary"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2001-4050","authenticated-orcid":false,"given":"Andreas","family":"Blenk","sequence":"additional","affiliation":[{"name":"Siemens AG, Munich, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7798-1711","authenticated-orcid":false,"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[{"name":"TU Berlin &amp; Fraunhofer SIT, Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6647-8002","authenticated-orcid":false,"given":"Chen","family":"Avin","sequence":"additional","affiliation":[{"name":"Ben Gurion University of the Negev, Beer-Sheva, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,3,2]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Mars: Near-Optimal Throughput with Shallow Buffers in Reconfigurable Datacenter Networks. In ACM SIGMETRICS (accepted).","author":"Addanki Vamsi","year":"2023","unstructured":"Vamsi Addanki, Chen Avin, and Stefan Schmid. 2023. Mars: Near-Optimal Throughput with Shallow Buffers in Reconfigurable Datacenter Networks. In ACM SIGMETRICS (accepted)."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402946.1402967"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851192"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3393691.3394205"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3310165.3310170"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976489.3"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3387514.3406221"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879175"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2253120"},{"key":"e_1_2_1_10_1","volume-title":"Proc. 14th USENIX Symposium on Networked Systems Design and Implementation (NSDI 17)","author":"Chen Li","year":"2017","unstructured":"Li Chen, Kai Chen, Zhonghua Zhu, Minlan Yu, George Porter, Chunming Qiao, and Shan Zhong. 2017. Enabling Wide-Spread Communications on Optical Fabric with Megaswitch. In Proc. 14th USENIX Symposium on Networked Systems Design and Implementation (NSDI 17) (Boston, MA, USA). USA, 577--593."},{"key":"e_1_2_1_11_1","volume-title":"Proc. Koninklijke Nederlandse Academie van Wetenschappen","volume":"49","author":"De Bruijn Nicolaas Govert","year":"1946","unstructured":"Nicolaas Govert De Bruijn. 1946. A combinatorial problem. In Proc. Koninklijke Nederlandse Academie van Wetenschappen, Vol. 49. 758--764."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2021.3075326"},{"key":"e_1_2_1_13_1","volume-title":"A flat and scalable data center network topology based on De Bruijn graphs. arXiv preprint arXiv:1610.03245","author":"D\u00fcrr Frank","year":"2016","unstructured":"Frank D\u00fcrr. 2016. A flat and scalable data center network topology based on De Bruijn graphs. arXiv preprint arXiv:1610.03245 (2016)."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851275.1851223"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230718.3230722"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1070873.1070877"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183369"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934911"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592576"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3491050"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1594977.1592577"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.osn.2021.100621"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1112\/jlms"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2740070.2626328"},{"key":"e_1_2_1_25_1","volume-title":"Reconfigurable Optical Networks Will Move SupercomputerData 100X Faster","author":"Hampson Michelle","unstructured":"Michelle Hampson. 2021. Reconfigurable Optical Networks Will Move SupercomputerData 100X Faster. In IEEE Spectrum."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098825"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1993.1026"},{"key":"e_1_2_1_28_1","volume-title":"Proc. ACM Workshop on Hot Topics in Networks (HotNets).","author":"Kandula Srikanth","year":"2009","unstructured":"Srikanth Kandula, Jitendra Padhye, and Paramvir Bahl. 2009. Flyways to de-congest data center networks. In Proc. ACM Workshop on Hot Topics in Networks (HotNets)."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098836"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335325"},{"key":"e_1_2_1_31_1","volume-title":"Introduction to parallel algorithms and architectures: Arrays\u00b7 trees\u00b7 hypercubes","author":"Leighton F Thomson","unstructured":"F Thomson Leighton. 2014. Introduction to parallel algorithms and architectures: Arrays\u00b7 trees\u00b7 hypercubes. Elsevier."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341302.3342085"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2740070.2626332"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/646334.687801"},{"key":"e_1_2_1_35_1","volume-title":"Proc. 17th USENIX Symposium on Networked Systems Design and Implementation (NSDI 20)","author":"Mellette William M","year":"2020","unstructured":"William M Mellette, Rajdeep Das, Yibo Guo, Rob McGuinness, Alex C Snoeren, and George Porter. 2020. Expanding across time to deliver bandwidth efficiency and low latency. In Proc. 17th USENIX Symposium on Networked Systems Design and Implementation (NSDI 20). 1--18."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098838"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2378956.2378964"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.808407"},{"key":"e_1_2_1_39_1","volume-title":"Proc. 19th USENIX Symposium on Networked Systems Design and Implementation (NSDI 22)","author":"Namkung Hun","year":"2022","unstructured":"Hun Namkung, Zaoxing Liu, Daehyeok Kim, Vyas Sekar, Peter Steenkiste, Guyue Liu, Ao Li, Christopher Canel, Adithya Abraham Philip, Ranysha Ware, et al. 2022. Sketchlib: Enabling efficient sketch-based monitoring on programmable switches. In Proc. 19th USENIX Symposium on Networked Systems Design and Implementation (NSDI 22). 743--759."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3452296.3472913"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3544216.3544265"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2410313"},{"key":"e_1_2_1_43_1","volume-title":"Online and Offline Greedy Algorithms for Routing with Switching Costs. arXiv preprint arXiv:1905.02800","author":"Schwartz Roy","year":"2019","unstructured":"Roy Schwartz, Mohit Singh, and Sina Yazdanbod. 2019. Online and Offline Greedy Algorithms for Routing with Switching Costs. arXiv preprint arXiv:1905.02800 (2019)."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2829988.2787508"},{"key":"e_1_2_1_45_1","volume-title":"Proc. 9th USENIX Symposium on Networked Systems Design and Implementation (NSDI 12)","author":"Singla Ankit","year":"2012","unstructured":"Ankit Singla, Chi-Yao Hong, Lucian Popa, and P Brighten Godfrey. 2012. Jellyfish: Networking data centers randomly. In Proc. 9th USENIX Symposium on Networked Systems Design and Implementation (NSDI 12). 225--238."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1868447.1868455"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1364\/JOCN.379487"},{"key":"e_1_2_1_48_1","volume-title":"Bojan Karlas, Muhsen Owaida, Ce Zhang, and Ankit Singla.","author":"Vojislav","year":"2019","unstructured":"Vojislav \u00d0uki?, Sangeetha Abdu Jyothi, Bojan Karlas, Muhsen Owaida, Ce Zhang, and Ankit Singla. 2019. Is advance knowledge of flow sizes a plausible assumption?. In 16th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 19). 565--580."},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2999572.2999610"},{"key":"e_1_2_1_50_1","first-page":"3","article-title":"Costly circuits, submodular schedules and approximate Carath\u00e9odory Theorems","volume":"88","author":"Venkatakrishnan Shaileshh Bojja","year":"2018","unstructured":"Shaileshh Bojja Venkatakrishnan, Mohammad Alizadeh, and Pramod Viswanath. 2018. Costly circuits, submodular schedules and approximate Carath\u00e9odory Theorems. Queueing Systems 88, 3--4 (2018), 311--347.","journal-title":"Queueing Systems"},{"key":"e_1_2_1_51_1","first-page":"327","article-title":"c-Through: Part-time optics in data centers","volume":"41","author":"Wang Guohui","year":"2011","unstructured":"Guohui Wang, David G Andersen, Michael Kaminsky, Konstantina Papagiannaki, TS Ng, Michael Kozuch, and Michael Ryan. 2011. c-Through: Part-time optics in data centers. ACM SIGCOMM Comput. Commun. Rev. (CCR) 41, 4 (2011), 327--338.","journal-title":"ACM SIGCOMM Comput. Commun. Rev. (CCR)"},{"key":"e_1_2_1_52_1","volume-title":"Proc. ACM SICOMM Conference","author":"Xia Yiting","unstructured":"Yiting Xia, Xiaoye Steven Sun, Simbarashe Dzinamarira, Dingming Wu, Xin Sunny Huang, and T. S. Eugene Ng. 2017. A Tale of Two Topologies: Exploring Convertible Data Center Network Architectures with Flat-Tree. In Proc. ACM SICOMM Conference (Los Angeles, CA, USA). 295--308."},{"key":"e_1_2_1_53_1","volume-title":"Gemini: Practical Reconfigurable Datacenter Networks with Topology and Traffic Engineering.","author":"Zhang Mingyang","year":"2021","unstructured":"Mingyang Zhang, Jianan Zhang, Rui Wang, Ramesh Govindan, Jeffrey C Mogul, and Amin Vahdat. 2021. Gemini: Practical Reconfigurable Datacenter Networks with Topology and Traffic Engineering. (2021). arXiv:2110.08374"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3131365.3131375"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/2377677.2377761"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2014.03.025"}],"container-title":["Proceedings of the ACM on Measurement and Analysis of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3579449","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3579449","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:46:41Z","timestamp":1750178801000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3579449"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,27]]},"references-count":56,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,2,27]]}},"alternative-id":["10.1145\/3579449"],"URL":"https:\/\/doi.org\/10.1145\/3579449","relation":{},"ISSN":["2476-1249"],"issn-type":[{"value":"2476-1249","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,27]]},"assertion":[{"value":"2023-03-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}