{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:57:12Z","timestamp":1770994632507,"version":"3.50.1"},"reference-count":92,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2023,7,18]],"date-time":"2023-07-18T00:00:00Z","timestamp":1689638400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"European Research Council","award":["864228"],"award-info":[{"award-number":["864228"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Model. Perform. Eval. Comput. Syst."],"published-print":{"date-parts":[[2023,9,30]]},"abstract":"<jats:p>Emerging reconfigurable data centers introduce unprecedented flexibility in how the physical layer can be programmed to adapt to current traffic demands. These reconfigurable topologies are commonly hybrid, consisting of static and reconfigurable links, enabled by e.g., an Optical Circuit Switch (OCS) connected to top-of-rack switches in Clos networks. Even though prior work has showcased the practical benefits of hybrid networks, several crucial performance aspects are not well understood. For example, many systems enforce artificial segregation of the hybrid network parts, leaving money on\u00a0the\u00a0table.<\/jats:p>\n          <jats:p>In this article, we study the algorithmic problem of how to jointly optimize topology and routing in reconfigurable data centers, in order to optimize a most fundamental metric, maximum link load. The complexity of reconfiguration mechanisms in this space is unexplored at large, especially for the following cross-layer network-design problem: given a hybrid network and a traffic matrix, jointly design the physical layer and the flow routing in order to minimize the maximum link load.<\/jats:p>\n          <jats:p>We chart the corresponding algorithmic landscape in our work, investigating both un-\/splittable flows and (non-)segregated routing policies. A topological complexity classification of the problem reveals NP-hardness in general for network topologies that are trees of depth at least two, in contrast to the tractability on trees of depth one. We moreover prove that the problem is not submodular for all these routing policies, even in multi-layer trees.<\/jats:p>\n          <jats:p>However, networks that can be abstracted by a single packet switch (e.g., nonblocking Fat-Tree topologies) can be optimized efficiently, and we present optimal polynomial-time algorithms accordingly. We complement our theoretical results with trace-driven simulation studies, where our algorithms can significantly improve the network load in comparison to the state-of-the-art.<\/jats:p>","DOI":"10.1145\/3597200","type":"journal-article","created":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T11:52:01Z","timestamp":1683892321000},"page":"1-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Load-optimization in Reconfigurable Data-center Networks: Algorithms and Complexity of Flow Routing"],"prefix":"10.1145","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2153-4250","authenticated-orcid":false,"given":"Wenkai","family":"Dai","sequence":"first","affiliation":[{"name":"Faculty of Computer Science, University of Vienna, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4635-4480","authenticated-orcid":false,"given":"Klaus-Tycho","family":"Foerster","sequence":"additional","affiliation":[{"name":"Faculty of Computer Science, TU Dortmund University, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1966-6331","authenticated-orcid":false,"given":"David","family":"Fuchssteiner","sequence":"additional","affiliation":[{"name":"Faculty of Computer Science, University of Vienna, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7798-1711","authenticated-orcid":false,"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[{"name":"TU Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,7,18]]},"reference":[{"key":"e_1_3_3_2_2","unstructured":"Nobel Prize Outreach AB. 2012. The Prize in Economic Sciences 2012 . Retrieved from https:\/\/www.nobelprize.org\/prizes\/economic-sciences\/2012\/summary\/. Accessed 11-11-2021."},{"key":"e_1_3_3_3_2","unstructured":"US DOE. 2016. Characterization of the DOE Mini-apps . portal.nersc.gov\/project\/CAL\/doe-miniapps.htm."},{"key":"e_1_3_3_4_2","volume-title":"Network Flows - Theory, Algorithms and Applications","author":"Ahuja Ravindra K.","year":"1993","unstructured":"Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. 1993. Network Flows - Theory, Algorithms and Applications. Prentice Hall."},{"key":"e_1_3_3_5_2","volume-title":"Proceedings of the SIGCOMM","author":"Al-Fares Mohammad","year":"2008","unstructured":"Mohammad Al-Fares, Alexander Loukissas, and Amin Vahdat. 2008. A scalable, commodity data center network architecture. In Proceedings of the SIGCOMM."},{"issue":"5","key":"e_1_3_3_6_2","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1145\/2829988.2790035","article-title":"A high-radix, low-latency optical switch for data centers","volume":"45","author":"Alistarh Dan","year":"2015","unstructured":"Dan Alistarh, Hitesh Ballani, Paolo Costa, Adam C. Funnell, Joshua Benjamin, Philip M. Watts, and Benn Thomsen. 2015. A high-radix, low-latency optical switch for data centers. Computer Communication Review 45, 5 (2015), 367\u2013368.","journal-title":"Computer Communication Review"},{"key":"e_1_3_3_7_2","volume-title":"Proceedings of the SIGCOMM","author":"Alizadeh Mohammad","year":"2013","unstructured":"Mohammad Alizadeh, Shuang Yang, Milad Sharif, Sachin Katti, Nick McKeown, Balaji Prabhakar, and Scott Shenker. 2013. pFabric: Minimal near-optimal datacenter transport. In Proceedings of the SIGCOMM. ACM."},{"key":"e_1_3_3_8_2","volume-title":"Proceedings of the ACM SIGMETRICS","author":"Avin Chen","year":"2020","unstructured":"Chen Avin, Manya Ghobadi, Chen Griner, and Stefan Schmid. 2020. On the complexity of traffic traces and implications. In Proceedings of the ACM SIGMETRICS."},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2017.12.008"},{"key":"e_1_3_3_10_2","volume-title":"Proceedings of the DISC","author":"Avin Chen","year":"2017","unstructured":"Chen Avin, Kaushik Mondal, and Stefan Schmid. 2017. Demand-aware network designs of bounded degree. In Proceedings of the DISC."},{"key":"e_1_3_3_11_2","volume-title":"Proceedings of the INFOCOM","author":"Avin Chen","year":"2019","unstructured":"Chen Avin, Kaushik Mondal, and Stefan Schmid. 2019. Demand-aware network design with minimal congestion and route lengths. In Proceedings of the INFOCOM. IEEE."},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/3310165.3310170"},{"key":"e_1_3_3_13_2","volume-title":"Proceedings of the SIGCOMM","author":"Azimi Navid Hamed","year":"2014","unstructured":"Navid Hamed Azimi, Zafar Ayyub Qazi, Himanshu Gupta, Vyas Sekar, Samir R. Das, Jon P. Longtin, Himanshu Shah, and Ashish Tanwer. 2014. FireFly: A reconfigurable wireless data center fabric using free-space optics. In Proceedings of the SIGCOMM. ACM."},{"key":"e_1_3_3_14_2","volume-title":"Proceedings of the Internet Measurement Conference","author":"Benson Theophilus","year":"2010","unstructured":"Theophilus Benson, Aditya Akella, and David A. Maltz. 2010. Network traffic characteristics of data centers in the wild. In Proceedings of the Internet Measurement Conference. ACM."},{"key":"e_1_3_3_15_2","unstructured":"Calient. 2018. Edge 640 Optical Circuit Switch. Retrieved from https:\/\/www.calient.net\/products\/edge640-optical-circuit-switch\/. Accessed 11-11-2021."},{"key":"e_1_3_3_16_2","volume-title":"Proceedings of the CoNEXT","author":"Cao Jiaxin","year":"2013","unstructured":"Jiaxin Cao, Rui Xia, Pengkun Yang, Chuanxiong Guo, Guohan Lu, Lihua Yuan, Yixin Zheng, Haitao Wu, Yongqiang Xiong, and David A. Maltz. 2013. Per-packet load-balanced, low-latency routing for clos-based data center networks. In Proceedings of the CoNEXT. ACM."},{"key":"e_1_3_3_17_2","first-page":"1","volume-title":"Proceedings of the Networking","author":"Ceylan Esra","year":"2021","unstructured":"Esra Ceylan, Klaus-Tycho Foerster, Stefan Schmid, and Katsiaryna Zaitsava. 2021. Demand-aware plane spanners of bounded degree. In Proceedings of the Networking. IEEE, 1\u20139."},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2253120"},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1953.tb01433.x"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.5555\/1614191"},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2022.42"},{"key":"e_1_3_3_22_2","volume-title":"Proceedings of the INFOCOM","author":"Dinitz Michael","year":"2020","unstructured":"Michael Dinitz and Benjamin Moseley. 2020. Scheduling for weighted flow and completion times in reconfigurable networks. In Proceedings of the INFOCOM. IEEE."},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-016-0269-x"},{"key":"e_1_3_3_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6567015"},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/2529989"},{"key":"e_1_3_3_26_2","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1145\/316188.316209","volume-title":"Proceedings of the SIGCOMM","author":"Duffield Nick G.","year":"1999","unstructured":"Nick G. Duffield, Pawan Goyal, Albert G. Greenberg, Partho Pratim Mishra, K. K. Ramakrishnan, and Jacobus E. van der Merwe. 1999. A flexible model for resource management in virtual private networks. In Proceedings of the SIGCOMM. ACM, 95\u2013108."},{"issue":"17","key":"e_1_3_3_27_2","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"Paths, trees, and flowers","author":"Edmonds Jack","year":"1965","unstructured":"Jack Edmonds. 1965. Paths, trees, and flowers. Canadian Journal of Mathematics17 (1965), 449\u2013467.","journal-title":"Canadian Journal of Mathematics"},{"key":"e_1_3_3_28_2","unstructured":"Tom Empson and Scarlet Schwiderski-Grosche. 2019. Optics for the Cloud Research Alliance Establishes Collaborative Research Approach to Improving Cloud Technology. Retrieved from https:\/\/www.microsoft.com\/en-us\/research\/blog\/optics-for-the-cloud-research-alliance-establishes-collaborative-research-approach-to-improving-cloud-technology\/. Accessed 11-11-2021."},{"key":"e_1_3_3_29_2","unstructured":"facebook. 2018. Facebook Network Analytics Data Sharing. Retrieved from https:\/\/www.facebook.com\/groups\/1144031739005495\/. Accessed 11-11-2021."},{"key":"e_1_3_3_30_2","volume-title":"Proceedings of the SIGCOMM","author":"Farrington Nathan","year":"2010","unstructured":"Nathan Farrington, George Porter, Sivasankar Radhakrishnan, Hamid Hajabdolali Bazzaz, Vikram Subramanya, Yeshaiahu Fainman, George Papen, and Amin Vahdat. 2010. Helios: A hybrid electrical\/optical switch architecture for modular data centers. In Proceedings of the SIGCOMM. ACM."},{"key":"e_1_3_3_31_2","first-page":"38","volume-title":"Proceedings of the ANCS","author":"Fenz Thomas","year":"2021","unstructured":"Thomas Fenz, Klaus-Tycho Foerster, and Stefan Schmid. 2021. On efficient oblivious wavelength assignments for programmable wide-area topologies. In Proceedings of the ANCS. ACM, 38\u201351."},{"key":"e_1_3_3_32_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2020.10.003"},{"key":"e_1_3_3_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/3336937.3336939"},{"key":"e_1_3_3_34_2","volume-title":"Proceedings of the ANCS","author":"Foerster Klaus-T.","year":"2018","unstructured":"Klaus-T. Foerster, Manya Ghobadi, and Stefan Schmid. 2018. Characterizing the algorithmic complexity of reconfigurable data center architectures. In Proceedings of the ANCS. ACM."},{"key":"e_1_3_3_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/3351452.3351464"},{"key":"e_1_3_3_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2018.2876749"},{"key":"e_1_3_3_37_2","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey Michael R.","year":"1979","unstructured":"Michael R. Garey and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., New York."},{"key":"e_1_3_3_38_2","volume-title":"Proceedings of the SIGCOMM","author":"Ghobadi Monia","year":"2016","unstructured":"Monia Ghobadi, Ratul Mahajan, Amar Phanishayee, Nikhil R. Devanur, Janardhan Kulkarni, Gireeja Ranade, Pierre-Alexandre Blanche, Houman Rastegarfar, Madeleine Glick, and Daniel C. Kilper. 2016. ProjecToR: Agile reconfigurable data center interconnect. In Proceedings of the SIGCOMM. ACM."},{"key":"e_1_3_3_39_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.59"},{"key":"e_1_3_3_40_2","doi-asserted-by":"crossref","unstructured":"Jennifer Gossels Gagan Choudhury and Jennifer Rexford. 2019. Robust network design for IP\/optical backbones. Journal of Optical Communications and Networking 11 8 (2019) 478\u2013490.","DOI":"10.1364\/JOCN.11.000478"},{"key":"e_1_3_3_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/1897852.1897877"},{"key":"e_1_3_3_42_2","doi-asserted-by":"publisher","DOI":"10.1145\/3491050"},{"key":"e_1_3_3_43_2","first-page":"28","volume-title":"Proceedings of the OptSys@SIGCOMM","author":"Hall Matthew Nance","year":"2021","unstructured":"Matthew Nance Hall, Paul Barford, Klaus-Tycho Foerster, Manya Ghobadi, William Jensen, and Ramakrishnan Durairajan. 2021. Are WANs ready for optical topology programming?. In Proceedings of the OptSys@SIGCOMM. ACM, 28\u201333."},{"key":"e_1_3_3_44_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.osn.2021.100621"},{"key":"e_1_3_3_45_2","volume-title":"Proceedings of the SIGCOMM","author":"Halperin Daniel","year":"2011","unstructured":"Daniel Halperin, Srikanth Kandula, Jitendra Padhye, Paramvir Bahl, and David Wetherall. 2011. Augmenting data center networks with multi-gigabit wireless links. In Proceedings of the SIGCOMM. ACM."},{"key":"e_1_3_3_46_2","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2016.2521678"},{"key":"e_1_3_3_47_2","volume-title":"Proceedings of the INFOCOM","author":"Han Kai","year":"2015","unstructured":"Kai Han, Zhiming Hu, Jun Luo, and Liu Xiang. 2015. RUSH: Routing and scheduling for hybrid data center networks. In Proceedings of the INFOCOM. IEEE."},{"key":"e_1_3_3_48_2","unstructured":"Jeff Hecht. 2001. Many Approaches Taken for All-optical Switching. Retrieved from https:\/\/www.laserfocusworld.com\/optics\/article\/16556781\/many-approaches-taken-for-alloptical-switching. Accessed 11-11-2021."},{"key":"e_1_3_3_49_2","volume-title":"Proceedings of the INFOCOM","author":"Jia Su","year":"2017","unstructured":"Su Jia, Xin Jin, Golnaz Ghasemiesfeh, Jiaxin Ding, and Jie Gao. 2017. Competitive analysis for online scheduling in software-defined optical WAN. In Proceedings of the INFOCOM. IEEE."},{"key":"e_1_3_3_50_2","first-page":"87","volume-title":"Proceedings of the SIGCOMM","author":"Jin Xin","year":"2016","unstructured":"Xin Jin, Yiran Li, Da Wei, Siming Li, Jie Gao, Lei Xu, Guangzhi Li, Wei Xu, and Jennifer Rexford. 2016. Optimizing bulk transfers with software-defined optical WAN. In Proceedings of the SIGCOMM. ACM, 87\u2013100."},{"key":"e_1_3_3_51_2","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2011.122111.00069"},{"key":"e_1_3_3_52_2","volume-title":"Proceedings of the Internet Measurement Conference","author":"Kandula Srikanth","year":"2009","unstructured":"Srikanth Kandula, Sudipta Sengupta, Albert G. Greenberg, Parveen Patel, and Ronnie Chaiken. 2009. The nature of data center traffic: Measurements and analysis. In Proceedings of the Internet Measurement Conference. ACM."},{"key":"e_1_3_3_53_2","volume-title":"Proceedings of the SIGCOMM","author":"Kassing Simon","year":"2017","unstructured":"Simon Kassing, Asaf Valadarsky, Gal Shahaf, Michael Schapira, and Ankit Singla. 2017. Beyond fat-trees without antennae, mirrors, and disco-balls. In Proceedings of the SIGCOMM. ACM."},{"key":"e_1_3_3_54_2","unstructured":"Brian Lebiednik Aman Mangal and Niharika Tiwari. 2016. A survey and evaluation of data center network topologies. CoRR abs\/1605.01701 (2016). Retrieved from http:\/\/arxiv.org\/abs\/1605.01701"},{"key":"e_1_3_3_55_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1985.6312192"},{"key":"e_1_3_3_56_2","volume-title":"Proceedings of the NSDI","author":"Liu He","year":"2014","unstructured":"He Liu, Feng Lu, Alex Forencich, Rishi Kapoor, Malveeka Tewari, Geoffrey M. Voelker, George Papen, Alex C. Snoeren, and George Porter. 2014. Circuit switching under the radar with REACToR. In Proceedings of the NSDI. USENIX Association."},{"key":"e_1_3_3_57_2","volume-title":"Proceedings of the CoNEXT","author":"Liu He","year":"2015","unstructured":"He Liu, Matthew K. Mukerjee, Conglong Li, Nicolas Feltman, George Papen, Stefan Savage, Srinivasan Seshan, Geoffrey M. Voelker, David G. Andersen, Michael Kaminsky, George Porter, and Alex C. Snoeren. 2015. Scheduling techniques for hybrid circuit\/packet networks. In Proceedings of the CoNEXT. ACM."},{"issue":"10","key":"e_1_3_3_58_2","first-page":"2028","article-title":"LUMOS: A fast and efficient optical circuit switch scheduling technique","volume":"22","author":"Livshits Ariel","year":"2018","unstructured":"Ariel Livshits and Shay Vargaftik. 2018. LUMOS: A fast and efficient optical circuit switch scheduling technique. IEEECommunicationsLetters 22, 10 (2018), 2028\u20132031.","journal-title":"IEEECommunicationsLetters"},{"key":"e_1_3_3_59_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.2986904"},{"key":"e_1_3_3_60_2","volume-title":"Proceedings of the INFOCOM","author":"Luo Long","year":"2020","unstructured":"Long Luo, Klaus-Tycho Foerster, Stefan Schmid, and Hongfang Yu. 2020. SplitCast: Optimizing multicast flows in reconfigurable datacenter networks. In Proceedings of the INFOCOM. IEEE."},{"key":"e_1_3_3_61_2","volume-title":"Proceedings of the NSDI","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 Proceedings of the NSDI. https:\/\/dblp.org\/rec\/conf\/nsdi\/MelletteDGMSP20.html?view=bibtex."},{"key":"e_1_3_3_62_2","volume-title":"Proceedings of the SIGCOMM","author":"Mellette William M.","year":"2017","unstructured":"William M. Mellette, Rob McGuinness, Arjun Roy, Alex Forencich, George Papen, Alex C. Snoeren, and George Porter. 2017. RotorNet: A scalable, low-complexity, optical datacenter network. In Proceedings of the SIGCOMM. ACM."},{"key":"e_1_3_3_63_2","volume-title":"Proceedings of the HotNets","author":"Mellette William M.","year":"2016","unstructured":"William M. Mellette, Alex C. Snoeren, and George Porter. 2016. P-FatTree: A multi-channel datacenter network topology. In Proceedings of the HotNets. ACM."},{"key":"e_1_3_3_64_2","first-page":"1","article-title":"Cisco global cloud index: Forecast and methodology, 2015-2020. white paper","author":"Networking Cisco Visual","year":"2016","unstructured":"Cisco Visual Networking. 2016. Cisco global cloud index: Forecast and methodology, 2015-2020. white paper. Cisco Public, San Jose (2016), 1\u201329.","journal-title":"Cisco Public, San Jose"},{"key":"e_1_3_3_65_2","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2017.2782753"},{"key":"e_1_3_3_66_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2021.102238"},{"key":"e_1_3_3_67_2","unstructured":"Polatis. 2019. Series 6000n Network Optical Matrix Switch. Retrieved from https:\/\/www.hubersuhner.com\/en\/documents-repository\/technologies\/pdf\/data-sheets-optical-switches\/polatis-series-6000n. Accessed 11-11-2021."},{"key":"e_1_3_3_68_2","volume-title":"Proceedings of the SIGCOMM","author":"Porter George","year":"2013","unstructured":"George Porter, Richard D. Strong, Nathan Farrington, Alex Forencich, Pang-Chen Sun, Tajana Rosing, Yeshaiahu Fainman, George Papen, and Amin Vahdat. 2013. Integrating microsecond circuit switching into the data center. In Proceedings of the SIGCOMM. ACM."},{"key":"e_1_3_3_69_2","volume-title":"Proceedings of the SIGCOMM","author":"Raiciu Costin","year":"2011","unstructured":"Costin Raiciu, S\u00e9bastien Barr\u00e9, Christopher Pluntke, Adam Greenhalgh, Damon Wischik, and Mark Handley. 2011. Improving datacenter performance and robustness with multipath TCP. In Proceedings of the SIGCOMM. ACM."},{"key":"e_1_3_3_70_2","doi-asserted-by":"publisher","DOI":"10.1002\/dac.2402"},{"key":"e_1_3_3_71_2","doi-asserted-by":"crossref","unstructured":"Arjun Roy Hongyi Zeng Jasmeet Bagga George Porter and Alex C. Snoeren. 2015. Inside the social network\u2019s (Datacenter) network. In SIGCOMM ACM 123\u2013137.","DOI":"10.1145\/2829988.2787472"},{"key":"e_1_3_3_72_2","volume-title":"Proceedings of the OPODIS (LIPIcs\u201922)","author":"Rozen-Schiff Neta","year":"2022","unstructured":"Neta Rozen-Schiff, Klaus-Tycho Foerster, Stefan Schmid, and David Hay. 2022. Chopin: Combining distributed and centralized schedulers for self-adjusting datacenter networks. In Proceedings of the OPODIS (LIPIcs\u201922).Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_3_3_73_2","volume-title":"Proceedings of the CoNEXT","author":"Sen Siddhartha","year":"2013","unstructured":"Siddhartha Sen, David Shue, Sunghwan Ihm, and Michael J. Freedman. 2013. Scalable, optimal flow routing in datacenters via local link balancing. In Proceedings of the CoNEXT. ACM."},{"key":"e_1_3_3_74_2","doi-asserted-by":"publisher","DOI":"10.1145\/2975159"},{"key":"e_1_3_3_75_2","volume-title":"Proceedings of the SIGCOMM","author":"Singh Rachee","year":"2018","unstructured":"Rachee Singh, Manya Ghobadi, Klaus-T. Foerster, Mark Filer, and Phillipa Gill. 2018. RADWAN: Rate adaptive wide area network. In Proceedings of the SIGCOMM. ACM."},{"key":"e_1_3_3_76_2","volume-title":"Proceedings of the NSDI","author":"Singla Ankit","year":"2012","unstructured":"Ankit Singla, Chi-Yao Hong, Lucian Popa, and Philip Brighten Godfrey. 2012. Jellyfish: Networking data centers randomly. In Proceedings of the NSDI. USENIX."},{"key":"e_1_3_3_77_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2005.845549"},{"key":"e_1_3_3_78_2","volume-title":"Proceedings of the CoNEXT","author":"Valadarsky Asaf","year":"2016","unstructured":"Asaf Valadarsky, Gal Shahaf, Michael Dinitz, and Michael Schapira. 2016. Xpander: Towards optimal-performance datacenters. In Proceedings of the CoNEXT. ACM."},{"key":"e_1_3_3_79_2","doi-asserted-by":"publisher","DOI":"10.5555\/500776"},{"key":"e_1_3_3_80_2","volume-title":"Proceedings of the SIGMETRICS","year":"2016","unstructured":"Shaileshh Bojja Venkatakrishnan, Mohammad Alizadeh, and Pramod Viswanath. 2016. Costly circuits, submodular schedules and approximate Carath\u00e9odory theorems. In Proceedings of the SIGMETRICS. ACM."},{"key":"e_1_3_3_81_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-017-9546-x"},{"key":"e_1_3_3_82_2","volume-title":"Proceedings of the HotNets","year":"2009","unstructured":"Guohui Wang, David G. Andersen, Michael Kaminsky, Michael Kozuch, T. S. Eugene Ng, Konstantina Papagiannaki, Madeleine Glick, and Lily B. Mummert. 2009. Your data center is a router: The case for reconfigurable optical circuit switched paths. In Proceedings of the HotNets. ACM."},{"key":"e_1_3_3_83_2","volume-title":"Proceedings of the SIGCOMM","author":"Wang Guohui","year":"2010","unstructured":"Guohui Wang, David G. Andersen, Michael Kaminsky, Konstantina Papagiannaki, T. S. Eugene Ng, Michael Kozuch, and Michael P. Ryan. 2010. c-Through: Part-time optics in data centers. In Proceedings of the SIGCOMM. ACM."},{"key":"e_1_3_3_84_2","volume-title":"Proceedings of the NSDI","year":"2011","unstructured":"Damon Wischik, Costin Raiciu, Adam Greenhalgh, and Mark Handley. 2011. Design, implementation and evaluation of congestion control for multipath TCP. In Proceedings of the NSDI. USENIX Association."},{"key":"e_1_3_3_85_2","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2016.2626784"},{"key":"e_1_3_3_86_2","volume-title":"Proceedings of the INFOCOM","author":"Xia Yiting","year":"2015","unstructured":"Yiting Xia, T. S. Eugene Ng, and Xiaoye Steven Sun. 2015. Blast: Accelerating high-performance data analytics applications by optical multicast. In Proceedings of the INFOCOM."},{"key":"e_1_3_3_87_2","volume-title":"Proceedings of the SIGCOMM","author":"Xia Yiting","year":"2017","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 Proceedings of the SIGCOMM. ACM."},{"issue":"3","key":"e_1_3_3_88_2","article-title":"Achieving efficient routing in reconfigurable DCNs","volume":"3","author":"Yang Zhenjie","year":"2019","unstructured":"Zhenjie Yang, Yong Cui, Shihan Xiao, Xin Wang, Minming Li, Chuming Li, and Yadong Liu. 2019. Achieving efficient routing in reconfigurable DCNs. Proceedings of the ACM on Measurement and Analysis of Computing Systems 3, 3 (2019), 47:1\u201347:30.","journal-title":"Proceedings of the ACM on Measurement and Analysis of Computing Systems"},{"key":"e_1_3_3_89_2","volume-title":"Proceedings of the SIGMETRICS (Abstracts)","author":"Yang Zhenjie","year":"2020","unstructured":"Zhenjie Yang, Yong Cui, Shihan Xiao, Xin Wang, Minming Li, Chuming Li, and Yadong Liu. 2020. Achieving efficient routing in reconfigurable DCNs. In Proceedings of the SIGMETRICS (Abstracts). ACM."},{"key":"e_1_3_3_90_2","volume-title":"Proceedings of the IPDPS","author":"Yuan Xin","year":"2011","unstructured":"Xin Yuan. 2011. On nonblocking folded-clos networks in computer communication environments. In Proceedings of the IPDPS. IEEE."},{"key":"e_1_3_3_91_2","unstructured":"James Hongyi Zeng. 2017. Data Sharing on Traffic Pattern Inside Facebook\u2019s Datacenter Network. Retrieved from https:\/\/research.fb.com\/data-sharing-on-traffic-pattern-inside-facebooks-datacenter-network\/. Accessed 11-11-2021."},{"key":"e_1_3_3_92_2","volume-title":"Proceedings of the ICPP","author":"Zheng Jiaqi","year":"2019","unstructured":"Jiaqi Zheng, Qiming Zheng, Xiaofeng Gao, and Guihai Chen. 2019. Dynamic load balancing in hybrid switching data center networks with converters. In Proceedings of the ICPP. ACM."},{"key":"e_1_3_3_93_2","first-page":"560","volume-title":"Proceedings of the SIGCOMM","author":"Zhong Zhizhen","year":"2021","unstructured":"Zhizhen Zhong, Manya Ghobadi, Alaa Khaddaj, Jonathan Leach, Yiting Xia, and Ying Zhang. 2021. ARROW: Restoration-aware traffic engineering. In Proceedings of the SIGCOMM. ACM, 560\u2013579."}],"container-title":["ACM Transactions on Modeling and Performance Evaluation of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3597200","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3597200","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:06Z","timestamp":1750182546000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3597200"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,18]]},"references-count":92,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,9,30]]}},"alternative-id":["10.1145\/3597200"],"URL":"https:\/\/doi.org\/10.1145\/3597200","relation":{},"ISSN":["2376-3639","2376-3647"],"issn-type":[{"value":"2376-3639","type":"print"},{"value":"2376-3647","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,18]]},"assertion":[{"value":"2020-12-30","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-05-05","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}