{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T02:03:08Z","timestamp":1776304988485,"version":"3.50.1"},"reference-count":106,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2019,7,24]],"date-time":"2019-07-24T00:00:00Z","timestamp":1563926400000},"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":["SIGACT News"],"published-print":{"date-parts":[[2019,7,24]]},"abstract":"<jats:p>Emerging optical technologies introduce opportunities to recon gure network topologies at runtime. The resulting topological exibilities can be exploited to design novel demand-aware and self-adjusting networks. This paper provides an overview of the algorithmic problems introduced by this technology, and surveys rst solutions.<\/jats:p>","DOI":"10.1145\/3351452.3351464","type":"journal-article","created":{"date-parts":[[2019,7,25]],"date-time":"2019-07-25T12:34:33Z","timestamp":1564058073000},"page":"62-79","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":48,"title":["Survey of Reconfigurable Data Center Networks"],"prefix":"10.1145","volume":"50","author":[{"given":"Klaus-Tycho","family":"Foerster","sequence":"first","affiliation":[{"name":"University of Vienna, Vienna, Austria"}]},{"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[{"name":"University of Vienna, Vienna, Austria"}]}],"member":"320","published-online":{"date-parts":[[2019,7,24]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2684464.2684505"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402967"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2829988.2790035"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486031"},{"key":"e_1_2_1_5_1","volume-title":"Dec.","year":"2018","unstructured":"Arista. White Paper: A laymans guide to Layer 1 Switching. https:\/\/www.arista.com\/assets\/data\/pdf\/Whitepapers\/Laymans-Guide-White-Paper.pdf , Dec. 2018 . Arista. White Paper: A laymans guide to Layer 1 Switching. https:\/\/www.arista.com\/assets\/data\/pdf\/Whitepapers\/Laymans-Guide-White-Paper.pdf, Dec. 2018."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2013.40"},{"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":"DISC","author":"Avin C.","year":"2017","unstructured":"C. Avin , K. Mondal , and S. Schmid . Demand-aware network designs of bounded degree . In DISC , 2017 . C. Avin, K. Mondal, and S. Schmid. Demand-aware network designs of bounded degree. In DISC, 2017."},{"key":"e_1_2_1_9_1","volume-title":"Push-down trees: Optimal self-adjusting complete trees. CoRR, abs\/1807.04613v1","author":"Avin C.","year":"2018","unstructured":"C. Avin , K. Mondal , and S. Schmid . Push-down trees: Optimal self-adjusting complete trees. CoRR, abs\/1807.04613v1 , 2018 . C. Avin, K. Mondal, and S. Schmid. Push-down trees: Optimal self-adjusting complete trees. CoRR, abs\/1807.04613v1, 2018."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737431"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3310165.3310170"},{"key":"e_1_2_1_12_1","volume-title":"Renets: Toward statically optimal self-adjusting networks. CoRR, arXiv:1904.03263","author":"Avin C.","year":"2019","unstructured":"C. Avin and S. Schmid . Renets: Toward statically optimal self-adjusting networks. CoRR, arXiv:1904.03263 , 2019 . C. Avin and S. Schmid. Renets: Toward statically optimal self-adjusting networks. CoRR, arXiv:1904.03263, 2019."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626328"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2829988.2790002"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879175"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592681.1592692"},{"key":"e_1_2_1_17_1","first-page":"147","article-title":"Tres observaciones sobre el algebra lineal","volume":"5","author":"Birkho G.","year":"1946","unstructured":"G. Birkho . Tres observaciones sobre el algebra lineal . Univ. Nac. Tucuman, Ser. A , 5 : 147 { 154, 1946 . G. Birkho . Tres observaciones sobre el algebra lineal. Univ. Nac. Tucuman, Ser. A, 5:147{ 154, 1946.","journal-title":"Univ. Nac. Tucuman, Ser. A"},{"key":"e_1_2_1_18_1","volume-title":"Wireless data center networks: Advances, challenges, and opportunities. CoRR, abs\/1811.11717","author":"Celik A.","year":"2018","unstructured":"A. Celik , B. Shihada , and M. Alouini . Wireless data center networks: Advances, challenges, and opportunities. CoRR, abs\/1811.11717 , 2018 . A. Celik, B. Shihada, and M. Alouini. Wireless data center networks: Advances, challenges, and opportunities. CoRR, abs\/1811.11717, 2018."},{"key":"e_1_2_1_19_1","first-page":"156","volume-title":"NSDI","author":"Chatzieleftheriou A.","unstructured":"A. Chatzieleftheriou , S. Legtchenko , H. Williams , and A. I. T. Rowstron . Larry : Practical network recon gurability in the data center . In NSDI , pages 141{ 156 . USENIX Association, 2018. A. Chatzieleftheriou, S. Legtchenko, H. Williams, and A. I. T. Rowstron. Larry: Practical network recon gurability in the data center. In NSDI, pages 141{156. USENIX Association, 2018."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2253120"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2017.2688376"},{"key":"e_1_2_1_22_1","first-page":"593","volume-title":"NSDI","author":"Chen L.","unstructured":"L. Chen , K. Chen , Z. Zhu , M. Yu , G. Porter , C. Qiao , and S. Zhong . Enabling wide-spread communications on optical fabric with megaswitch . In NSDI , pages 577{ 593 . USENIX, 2017. L. Chen, K. Chen, Z. Zhu, M. Yu, G. Porter, C. Qiao, and S. Zhong. Enabling wide-spread communications on optical fabric with megaswitch. In NSDI, pages 577{593. USENIX, 2017."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1953.tb01433.x"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13731-0_39"},{"key":"e_1_2_1_25_1","volume-title":"Microsoft Research","author":"Devanur N.","year":"2016","unstructured":"N. Devanur , J. Kulkarni , G. Ranade , M. Ghobadi , R. Mahajan , and A. Phanishayee . Stable matching algorithm for an agile recon gurable data center interconnect (MSR-TR-2016--1140). Technical report , Microsoft Research , June 2016 . N. Devanur, J. Kulkarni, G. Ranade, M. Ghobadi, R. Mahajan, and A. Phanishayee. Stable matching algorithm for an agile recon gurable data center interconnect (MSR-TR-2016--1140). Technical report, Microsoft Research, June 2016."},{"key":"e_1_2_1_26_1","volume-title":"PCC: Re-architecting Congestion Control for Consistent High Performance. NSDI'15","author":"Dong M.","year":"2015","unstructured":"M. Dong , Q. Li , D. Zarchy , P. B. Godfrey , and M. Schapira . PCC: Re-architecting Congestion Control for Consistent High Performance. NSDI'15 , 2015 . M. Dong, Q. Li, D. Zarchy, P. B. Godfrey, and M. Schapira. PCC: Re-architecting Congestion Control for Consistent High Performance. NSDI'15, 2015."},{"key":"e_1_2_1_27_1","first-page":"580","volume-title":"NSDI","author":"Dukic V.","unstructured":"V. Dukic , S. A. Jyothi , B. Karlas , M. Owaida , C. Zhang , and A. Singla . Is advance knowledge of ow sizes a plausible assumption ? In NSDI , pages 565{ 580 . USENIX Association, 2019. V. Dukic, S. A. Jyothi, B. Karlas, M. Owaida, C. Zhang, and A. Singla. Is advance knowledge of ow sizes a plausible assumption? In NSDI, pages 565{580. USENIX Association, 2019."},{"key":"e_1_2_1_28_1","volume-title":"Grey ber: A system for providing exible access to wide-area connectivity. CoRR, abs\/1807.05242","author":"Durairajan R.","year":"2018","unstructured":"R. Durairajan , P. Barford , J. Sommers , and W. Willinger . Grey ber: A system for providing exible access to wide-area connectivity. CoRR, abs\/1807.05242 , 2018 . R. Durairajan, P. Barford, J. Sommers, and W. Willinger. Grey ber: A system for providing exible access to wide-area connectivity. CoRR, abs\/1807.05242, 2018."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1965-045-4"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/LPT.2013.2270462"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2390231.2390251"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851223"},{"key":"e_1_2_1_33_1","volume-title":"18th IFIP Networking Conference (IFIP Network- ing)","author":"Fenz T.","year":"2019","unstructured":"T. Fenz , K.-T. Foerster , S. Schmid , and A. Villedieu . Efficient non-segregated routing for recon gurable demand-aware networks . In 18th IFIP Networking Conference (IFIP Network- ing) , May 2019 . T. Fenz, K.-T. Foerster, S. Schmid, and A. Villedieu. Efficient non-segregated routing for recon gurable demand-aware networks. In 18th IFIP Networking Conference (IFIP Network- ing), May 2019."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230718.3230722"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3336937.3336939"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1962.11989827"},{"key":"e_1_2_1_37_1","volume-title":"June","author":"Ghobadi M.","year":"2016","unstructured":"M. Ghobadi , R. Mahajan , A. Phanishayee , P.-A. Blanche , H. Rastegarfar , M. Glick , and D. Kilper . Design of mirror assembly for an agile recon gurable data center interconnect (MSR-TR-2016--1139). Technical report , June 2016 . M. Ghobadi, R. Mahajan, A. Phanishayee, P.-A. Blanche, H. Rastegarfar, M. Glick, and D. Kilper. Design of mirror assembly for an agile recon gurable data center interconnect (MSR-TR-2016--1139). Technical report, June 2016."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934911"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098839"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1137\/100812513"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592576"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592577"},{"key":"e_1_2_1_43_1","volume-title":"NSDI","author":"Hall M.","year":"2018","unstructured":"M. Hall , V. Chidambaram , and R. Durairajan . vFiber: Virtualizing Unused Optical Fibers (Extended Abstract) . In NSDI , 2018 . M. Hall, V. Chidambaram, and R. Durairajan. vFiber: Virtualizing Unused Optical Fibers (Extended Abstract). In NSDI, 2018."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018442"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2016.2521678"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2999572.2999592"},{"key":"e_1_2_1_47_1","volume-title":"Proc. IEEE INFOCOM","author":"Jia S.","year":"2017","unstructured":"S. Jia , X. Jin , G. Ghasemiesfeh , J. Ding , and J. Gao . Competitive analysis for online scheduling in software-de ned optical wan . In Proc. IEEE INFOCOM , 2017 . S. Jia, X. Jin, G. Ghasemiesfeh, J. Ding, and J. Gao. Competitive analysis for online scheduling in software-de ned optical wan. In Proc. IEEE INFOCOM, 2017."},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934904"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3229584.3229587"},{"key":"e_1_2_1_50_1","volume-title":"HotNets. ACM SIGCOMM","author":"Kandula S.","year":"2009","unstructured":"S. Kandula , J. Padhye , and P. Bahl . Flyways to de-congest data center networks . In HotNets. ACM SIGCOMM , 2009 . S. Kandula, J. Padhye, and P. Bahl. Flyways to de-congest data center networks. In HotNets. ACM SIGCOMM, 2009."},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/1644893.1644918"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098836"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/LPT.2009.2036940"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2003.815843"},{"key":"e_1_2_1_55_1","volume-title":"NSDI. USENIX","author":"Liu H.","year":"2014","unstructured":"H. Liu , F. Lu , A. Forencich , R. Kapoor , M. Tewari , G. M. Voelker , G. Papen , A. C. Snoeren , and G. Porter . Circuit switching under the radar with reactor . In NSDI. USENIX , 2014 . H. Liu, F. Lu, A. Forencich, R. Kapoor, M. Tewari, G. M. Voelker, G. Papen, A. C. Snoeren, and G. Porter. Circuit switching under the radar with reactor. In NSDI. USENIX, 2014."},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/2716281.2836126"},{"key":"e_1_2_1_57_1","volume-title":"NSDI. USENIX","author":"Liu V.","year":"2013","unstructured":"V. Liu , D. Halperin , A. Krishnamurthy , and T. E. Anderson . F10: A fault-tolerant engineered network . In NSDI. USENIX , 2013 . V. Liu, D. Halperin, A. Krishnamurthy, and T. E. Anderson. F10: A fault-tolerant engineered network. In NSDI. USENIX, 2013."},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/3326285.3329063"},{"key":"e_1_2_1_59_1","volume-title":"Expanding across time to deliver bandwidth efficiency and low latency. CoRR, abs\/1903.12307","author":"Mellette W. M.","year":"2019","unstructured":"W. M. Mellette , R. Das , Y. Guo , R. McGuinness , A. C. Snoeren , and G. Porter . Expanding across time to deliver bandwidth efficiency and low latency. CoRR, abs\/1903.12307 , 2019 . W. M. Mellette, R. Das, Y. Guo, R. McGuinness, A. C. Snoeren, and G. Porter. Expanding across time to deliver bandwidth efficiency and low latency. CoRR, abs\/1903.12307, 2019."},{"key":"e_1_2_1_60_1","first-page":"1","volume-title":"Optical Fiber Communication Conference","author":"Mellette W. M.","unstructured":"W. M. Mellette and J. E. Ford . Scaling limits of free-space tilt mirror mems switches for data center networks . In Optical Fiber Communication Conference , pages M2B{ 1 . Optical Society of America, 2015. W. M. Mellette and J. E. Ford. Scaling limits of free-space tilt mirror mems switches for data center networks. In Optical Fiber Communication Conference, pages M2B{1. Optical Society of America, 2015."},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2015.2431231"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098838"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2016.2636025"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPSR.2018.8850741"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03685-9_21"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90041-S"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934879"},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/351827.384250"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273340.1273350"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.31219\/osf.io\/6qzxc"},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063952"},{"key":"e_1_2_1_73_1","first-page":"36","volume-title":"Proc. SIAM International Conference on Data Mining","author":"Parotsidis N.","unstructured":"N. Parotsidis , E. Pitoura , and P. Tsaparas . Selecting shortcuts for a smaller world . In Proc. SIAM International Conference on Data Mining , pages 28{ 36 . SIAM, 2015. N. Parotsidis, E. Pitoura, and P. Tsaparas. Selecting shortcuts for a smaller world. In Proc. SIAM International Conference on Data Mining, pages 28{36. SIAM, 2015."},{"key":"e_1_2_1_74_1","volume-title":"Distributed self-adjusting tree networks","author":"Peres B.","year":"2019","unstructured":"B. Peres , O. A. de Oliveira Souza , O. Goussevskaia , C. Avin , and S. Schmid . Distributed self-adjusting tree networks . In INFOCOM. IEEE , 2019 . B. Peres, O. A. de Oliveira Souza, O. Goussevskaia, C. Avin, and S. Schmid. Distributed self-adjusting tree networks. In INFOCOM. IEEE, 2019."},{"key":"e_1_2_1_75_1","volume-title":"Proc. International Symposium on Distributed Computing (DISC)","author":"Peres B.","year":"2017","unstructured":"B. Peres , O. Goussevskaia , S. Schmid , and C. Avin . Concurrent self-adjusting distributed tree networks . In Proc. International Symposium on Distributed Computing (DISC) , 2017 . B. Peres, O. Goussevskaia, S. Schmid, and C. Avin. Concurrent self-adjusting distributed tree networks. In Proc. International Symposium on Distributed Computing (DISC), 2017."},{"key":"e_1_2_1_76_1","volume-title":"Integrating microsecond circuit switching into the data center","author":"Porter G.","year":"2013","unstructured":"G. Porter , R. D. Strong , N. Farrington , A. Forencich , P. Sun , T. Rosing , Y. Fainman , G. Papen , and A. Vahdat . Integrating microsecond circuit switching into the data center . 2013 . G. Porter, R. D. Strong, N. Farrington, A. Forencich, P. Sun, T. Rosing, Y. Fainman, G. Papen, and A. Vahdat. Integrating microsecond circuit switching into the data center. 2013."},{"key":"e_1_2_1_77_1","volume-title":"NEC Research Paper","author":"Ramachandran K.","year":"2008","unstructured":"K. Ramachandran , R. Kokku , R. Mahindra , and S. Rangarajan . 60 ghz data-center networking: Wireless ! worry less ? NEC Research Paper , 2008 . K. Ramachandran, R. Kokku, R. Mahindra, and S. Rangarajan. 60 ghz data-center networking: Wireless ! worry less? NEC Research Paper, 2008."},{"key":"e_1_2_1_78_1","first-page":"332","volume-title":"2012 8th International Wireless Communications and Mobile Computing Conference (IWCMC)","author":"Riza N. A.","unstructured":"N. A. Riza and P. J. Marraccini . Power smart in-door optical wireless link applications . In 2012 8th International Wireless Communications and Mobile Computing Conference (IWCMC) , pages 327{ 332 . IEEE, 2012. N. A. Riza and P. J. Marraccini. Power smart in-door optical wireless link applications. In 2012 8th International Wireless Communications and Mobile Computing Conference (IWCMC), pages 327{332. IEEE, 2012."},{"key":"e_1_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1145\/2829988.2787472"},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1145\/3229543.3229554"},{"key":"e_1_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2410313"},{"key":"e_1_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1145\/2829988.2787508"},{"key":"e_1_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1145\/3152434.3152451"},{"key":"e_1_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230570"},{"key":"e_1_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1145\/3005745.3005747"},{"key":"e_1_2_1_86_1","volume-title":"HotCloud","author":"Singla A.","year":"2011","unstructured":"A. Singla , C. Hong , L. Popa , and P. B. Godfrey . Jelly sh: Networking data centers, randomly . In HotCloud . USENIX Association , 2011 . A. Singla, C. Hong, L. Popa, and P. B. Godfrey. Jelly sh: Networking data centers, randomly. In HotCloud. USENIX Association, 2011."},{"key":"e_1_2_1_87_1","volume-title":"NSDI. USENIX","author":"Singla A.","year":"2012","unstructured":"A. Singla , C. Hong , L. Popa , and P. B. Godfrey . Jelly sh: Networking data centers randomly . In NSDI. USENIX , 2012 . A. Singla, C. Hong, L. Popa, and P. B. Godfrey. Jelly sh: Networking data centers randomly. In NSDI. USENIX, 2012."},{"key":"e_1_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.1145\/1868447.1868455"},{"key":"e_1_2_1_89_1","first-page":"6","volume-title":"ICNP","author":"Sun X. S.","unstructured":"X. S. Sun and T. S. E. Ng . When creek meets river: Exploiting high-bandwidth circuit switch in scheduling multicast data . In ICNP , pages 1{ 6 . IEEE Computer Society, 2017. X. S. Sun and T. S. E. Ng. When creek meets river: Exploiting high-bandwidth circuit switch in scheduling multicast data. In ICNP, pages 1{6. IEEE Computer Society, 2017."},{"key":"e_1_2_1_90_1","first-page":"87","volume-title":"ICNP","author":"Sun X. S.","unstructured":"X. S. Sun , Y. Xia , S. Dzinamarira , X. S. Huang , D. Wu , and T. S. E. Ng. Republic : Data multicast meets hybrid rack-level interconnections in data center . In ICNP , pages 77{ 87 . IEEE Computer Society, 2018. X. S. Sun, Y. Xia, S. Dzinamarira, X. S. Huang, D. Wu, and T. S. E. Ng. Republic: Data multicast meets hybrid rack-level interconnections in data center. In ICNP, pages 77{87. IEEE Computer Society, 2018."},{"key":"e_1_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.5555\/3154576"},{"key":"e_1_2_1_92_1","doi-asserted-by":"publisher","DOI":"10.1145\/2999572.2999580"},{"key":"e_1_2_1_93_1","doi-asserted-by":"publisher","DOI":"10.1137\/0211027"},{"key":"e_1_2_1_94_1","doi-asserted-by":"publisher","DOI":"10.1145\/2896377.2901479"},{"key":"e_1_2_1_95_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-017-9546-x"},{"key":"e_1_2_1_96_1","volume-title":"A certain zero-sum two-person game equivalent to the optimal assignment problem. Contributions to the Theory of Games, 2(0):5{12","author":"Neumann J. Von","year":"1953","unstructured":"J. Von Neumann . A certain zero-sum two-person game equivalent to the optimal assignment problem. Contributions to the Theory of Games, 2(0):5{12 , 1953 . J. Von Neumann. A certain zero-sum two-person game equivalent to the optimal assignment problem. Contributions to the Theory of Games, 2(0):5{12, 1953."},{"key":"e_1_2_1_97_1","volume-title":"HotNets. ACM SIGCOMM","author":"Wang G.","year":"2009","unstructured":"G. Wang , D. G. Andersen , M. Kaminsky , M. Kozuch , T. S. E. Ng , K. Papagiannaki , M. Glick , and L. B. Mummert . Your data center is a router: The case for recon gurable optical circuit switched paths . In HotNets. ACM SIGCOMM , 2009 . G. Wang, D. G. Andersen, M. Kaminsky, M. Kozuch, T. S. E. Ng, K. Papagiannaki, M. Glick, and L. B. Mummert. Your data center is a router: The case for recon gurable optical circuit switched paths. In HotNets. ACM SIGCOMM, 2009."},{"key":"e_1_2_1_98_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851222"},{"key":"e_1_2_1_99_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500098.2500105"},{"key":"e_1_2_1_100_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2018.2889251"},{"key":"e_1_2_1_101_1","doi-asserted-by":"publisher","DOI":"10.1145\/3224421"},{"key":"e_1_2_1_102_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2016.2626784"},{"key":"e_1_2_1_103_1","first-page":"1938","volume-title":"INFOCOM","author":"Xia Y.","unstructured":"Y. Xia , T. S. E. Ng , and X. S. Sun . Blast: Accelerating high-performance data analytics applications by optical multicast . In INFOCOM , pages 1930{ 1938 . IEEE, 2015. Y. Xia, T. S. E. Ng, and X. S. Sun. Blast: Accelerating high-performance data analytics applications by optical multicast. In INFOCOM, pages 1930{1938. IEEE, 2015."},{"key":"e_1_2_1_104_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098837"},{"key":"e_1_2_1_105_1","doi-asserted-by":"publisher","DOI":"10.1145\/2377677.2377761"},{"key":"e_1_2_1_106_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098849"},{"key":"e_1_2_1_107_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2014.03.025"}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3351452.3351464","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3351452.3351464","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:25:52Z","timestamp":1750206352000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3351452.3351464"}},"subtitle":["Enablers, Algorithms, Complexity"],"short-title":[],"issued":{"date-parts":[[2019,7,24]]},"references-count":106,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,7,24]]}},"alternative-id":["10.1145\/3351452.3351464"],"URL":"https:\/\/doi.org\/10.1145\/3351452.3351464","relation":{},"ISSN":["0163-5700"],"issn-type":[{"value":"0163-5700","type":"print"}],"subject":[],"published":{"date-parts":[[2019,7,24]]},"assertion":[{"value":"2019-07-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}