{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:22:21Z","timestamp":1753438941736,"version":"3.41.0"},"reference-count":30,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2022,3,22]],"date-time":"2022-03-22T00:00:00Z","timestamp":1647907200000},"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":["SIGMETRICS Perform. Eval. Rev."],"published-print":{"date-parts":[[2022,3,22]]},"abstract":"<jats:p>The performance of more and more cloud-based applications critically depends on the performance of the interconnecting datacenter network. Emerging reconfigurable datacenter networks have the potential to provide an unprecedented throughput by dynamically reconfiguring their topology in a demand-aware manner. This paper studies the algorithmic problem of how to design low-degree and hence scalable datacenter networks optimized toward the current traffic they serve. Our main contribution is a novel network design which provides asymptotically minimal route lengths and congestion. In comparison to prior work, we reduce the degree requirements by a factor of four for sparse demand matrices. We further show the problem to be already NP-hard for tree-shaped demands, but permits a 2-approximation on the route lengths and a 6-approximation for congestion. We further report on a small empirical study on Facebook traces.<\/jats:p>","DOI":"10.1145\/3529113.3529125","type":"journal-article","created":{"date-parts":[[2022,3,25]],"date-time":"2022-03-25T22:30:42Z","timestamp":1648247442000},"page":"35-36","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Improved Scalability of Demand-Aware Datacenter Topologies With Minimal Route Lengths and Congestion"],"prefix":"10.1145","volume":"49","author":[{"given":"Maciej","family":"Pacut","sequence":"first","affiliation":[{"name":"University of Vienna, Vienna, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenkai","family":"Dai","sequence":"additional","affiliation":[{"name":"University of Vienna, Vienna, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandre","family":"Labbe","sequence":"additional","affiliation":[{"name":"Institut Polytechnique de Paris ENSTA Paris, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus-Tycho","family":"Foerster","sequence":"additional","affiliation":[{"name":"TU Dortmund, Dortmund, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[{"name":"University of Vienna, Vienna, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,3,25]]},"reference":[{"issue":"63","key":"e_1_2_1_1_1","first-page":"68","article-title":"Minimum linear arrangements","volume":"62","author":"Andrade R.","year":"2017","unstructured":"R. Andrade Minimum linear arrangements . Elect. Notes in Discr. Mathematics , 62 : 63 -- 68 , 2017 . R. Andrade et al. Minimum linear arrangements. Elect. Notes in Discr. Mathematics, 62:63 -- 68, 2017.","journal-title":"Elect. Notes in Discr. Mathematics"},{"key":"e_1_2_1_2_1","volume-title":"Proc. DISC","author":"Avin C.","year":"2017","unstructured":"C. Avin Demand-aware network designs of bounded degree . In Proc. DISC , 2017 . C. Avin et al. Demand-aware network designs of bounded degree. In Proc. DISC, 2017."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737431"},{"key":"e_1_2_1_4_1","volume-title":"Demand-aware network designs of bounded degree. Distributed Comput., 33(3--4):311--325","author":"Avin C.","year":"2020","unstructured":"C. Avin Demand-aware network designs of bounded degree. Distributed Comput., 33(3--4):311--325 , 2020 . C. Avin et al. Demand-aware network designs of bounded degree. Distributed Comput., 33(3--4):311--325, 2020."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3379486"},{"key":"e_1_2_1_6_1","volume-title":"An online matching model for self-adjusting tor-to-tor networks. arXiv:2006.11148","author":"Avin C.","year":"2020","unstructured":"C. Avin An online matching model for self-adjusting tor-to-tor networks. arXiv:2006.11148 , 2020 . C. Avin et al. An online matching model for self-adjusting tor-to-tor networks. arXiv:2006.11148, 2020."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2017.12.008"},{"key":"e_1_2_1_8_1","volume-title":"Proc. ACM SIGCOMM","author":"Azimi N. H.","year":"2014","unstructured":"N. H. Azimi : a reconfigurable wireless data center fabric using free-space optics . In Proc. ACM SIGCOMM , 2014 . N. H. Azimi et al. Firefly: a reconfigurable wireless data center fabric using free-space optics. In Proc. ACM SIGCOMM, 2014."},{"key":"e_1_2_1_9_1","volume-title":"Proc. ACM SIGCOMM","author":"Ballani H.","year":"2020","unstructured":"H. Ballani : A flat datacenter network with nanosecond optical switching . In Proc. ACM SIGCOMM , 2020 . H. Ballani et al. Sirius: A flat datacenter network with nanosecond optical switching. In Proc. ACM SIGCOMM, 2020."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.23919\/IFIPNetworking52078.2021.9472769"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2253120"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3453953.3453962"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2020.10.003"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230718.3230722"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3336937.3336939"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3351452.3351464"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934911"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592577"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.osn.2021.100621"},{"key":"e_1_2_1_20_1","volume-title":"Proc. ACM HotNets","author":"Kandula S.","year":"2009","unstructured":"S. Kandula Flyways to de-congest data center networks . Proc. ACM HotNets , 2009 . S. Kandula et al. Flyways to de-congest data center networks. Proc. ACM HotNets, 2009."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1644893.1644918"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098836"},{"key":"e_1_2_1_23_1","volume-title":"Proc. ACM SIGCOMM","author":"Li Y.","year":"2019","unstructured":"Y. Li : high precision congestion control . In Proc. ACM SIGCOMM , 2019 . Y. Li et al. Hpcc: high precision congestion control. In Proc. ACM SIGCOMM, 2019."},{"key":"e_1_2_1_24_1","volume-title":"Proc. ACM SIGCOMM. ACM","author":"Mellette W. M.","year":"2017","unstructured":"W. M. Mellette : A scalable, low-complexity, optical datacenter network . In Proc. ACM SIGCOMM. ACM , 2017 . W. M. Mellette et al. Rotornet: A scalable, low-complexity, optical datacenter network. In Proc. ACM SIGCOMM. ACM, 2017."},{"key":"e_1_2_1_25_1","volume-title":"Proc. USENIX NSDI","author":"Mellette W. M.","year":"2020","unstructured":"W. M. Mellette Expanding across time to deliver bandwidth efficiency and low latency . In Proc. USENIX NSDI , 2020 . W. M. Mellette et al. Expanding across time to deliver bandwidth efficiency and low latency. In Proc. USENIX NSDI, 2020."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2378956.2378964"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2021.102238"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787472"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2975159"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2342356.2342440"}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3529113.3529125","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3529113.3529125","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:51:25Z","timestamp":1750182685000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3529113.3529125"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,22]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,3,22]]}},"alternative-id":["10.1145\/3529113.3529125"],"URL":"https:\/\/doi.org\/10.1145\/3529113.3529125","relation":{},"ISSN":["0163-5999"],"issn-type":[{"type":"print","value":"0163-5999"}],"subject":[],"published":{"date-parts":[[2022,3,22]]},"assertion":[{"value":"2022-03-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}