Abstract
Heavy and highly dynamic traffic demands in today's data center networks (DCNs) pose great challenges to efficient traffic engineering. With gigabit bandwidth, wireless communication technologies, such as free space optics and 60GHz wireless, are promising to augment DCNs and enable efficient traffic engineering. Complementary to the emerging reconfigurable architectures, we aim to achieve efficient routing and effectively balance the load with the performance guarantee. We derive a general interference model and propose a decomposition technique with proven performance guarantee and solve the load balancing problem in reconfigurable DCNs. In addition, we propose two solutions, WiRo and OFS, to flexibly reconfigure network topology and enable hybrid-routing with paths consisting of both stable wired links and flexible wireless links with different methods. Our measurement-facilitated and trace-driven simulations demonstrate that our solutions outperform existing flow scheduling algorithms with the average throughput of large flows increased by up to 190% and the average completion time reduced by up to 72.6%. Meanwhile, the average completion time of small flows is reduced by up to 64.5%.
- Mohammad Al-Fares, Alexander Loukissas, and Amin Vahdat. 2008. A Scalable, Commodity Data Center Network Architecture. In SIGCOMM.Google Scholar
- Mohammad Al-Fares, Sivasankar Radhakrishnan, Barath Raghavan, Nelson Huang, and Amin Vahdat. 2010. Hedera: Dynamic Flow Scheduling for Data Center Networks. In NSDI.Google Scholar
Digital Library
- Mohammad Alizadeh, Albert Greenberg, David A Maltz, Jitendra Padhye, Parveen Patel, Balaji Prabhakar, Sudipta Sengupta, and Murari Sridharan. 2010. Data Center TCP (DCTCP). In SIGCOMM.Google Scholar
- Chen Avin, Kaushik Mondal, and Stefan Schmid. 2017. Demand-Aware Network Designs of Bounded Degree. In DISC (LIPIcs).Google Scholar
- Chen Avin, Kaushik Mondal, and Stefan Schmid. 2019. Demand-Aware Network Design with Minimal Congestion and Route Lengths. In INFOCOM.Google Scholar
- Chen Avin and Stefan Schmid. 2019. Toward Demand-Aware Networking: A Theory for Self-Adjusting Networks. ACM SIGCOMM Computer Communication Review, Vol. 48, 5 (2019), 31--40.Google Scholar
Digital Library
- Wei Bai, Li Chen, Kai Chen, Dongsu Han, Chen Tian, and Hao Wang. 2015. Information-Agnostic Flow Scheduling for Commodity Data Centers. In USENIX NSDI. 455--468.Google Scholar
- Theophilus Benson, Aditya Akella, and David A Maltz. 2010a. Network Traffic Characteristics of Data Centers in the Wild. In IMC.Google Scholar
- Theophilus Benson, Aditya Akella, and David A. Maltz. 2010b. http://pages.cs.wisc.edu/ tbenson/IMC10_Data. (2010).Google Scholar
- Theophilus Benson, Ashok Anand, Aditya Akella, and Ming Zhang. 2011. MicroTE: Fine Grained Traffic Engineering for Data Centers. In CoNEXT.Google Scholar
- Jiaxin Cao, Rui Xia, Pengkun Yang, Chuanxiong Guo, Guohan Lu, Lihua Yuan, Yixin Zheng, Haitao Wu, Yongqiang Xiong, and Dave Maltz. 2013. Per-packet Load-balanced, Low-Latency Routing for Clos-based Data Center Networks. In CoNEXT.Google Scholar
- Robert Carr and Santosh Vempala. 2000. Randomized Metarounding. In STOC.Google Scholar
- Kai Chen, Ankit Singla, Atul Singh, Kishore Ramachandran, Lei Xu, Yueping Zhang, Xitao Wen, and Yan Chen. 2014. OSA: An Optical Switching Architecture for Data Center Networks with Unprecedented Flexibility. IEEE/ACM Transactions on Networking (ToN), Vol. 22, 2 (2014), 498--511.Google Scholar
Digital Library
- Y. Cui, H. Wang, X. Cheng, D. Li, and A. Yl"a-J"a"aski. 2013. Dynamic Scheduling for Wireless Data Center Networks. IEEE Transactions on Parallel and Distributed Systems (TPDS), Vol. 24, 12 (2013), 2365--2374.Google Scholar
Digital Library
- Yong Cui, Shihan Xiao, Xin Wang, Zhenjie Yang, Chao Zhu, Xiangyang Li, Liu Yang, and Ning Ge. 2016. Diamond: Nesting the Data Center Network with Wireless Rings in 3D Space. In NSDI.Google Scholar
- Yong Cui, Zhenjie Yang, Shihan Xiao, Xin Wang, and Shenghui Yan. 2017. Traffic-Aware Virtual Machine Migration in Topology-Adaptive DCN. IEEE/ACM Transactions on Networking (ToN), Vol. 25, 6 (2017), 3427--3440.Google Scholar
Digital Library
- Devdatt Dubhashi and Desh Ranjan. 1998. Balls and Bins: A Study in Negative Dependence. Random Structures & Algorithms, Vol. 13, 2 (1998), 99--124.Google Scholar
Digital Library
- 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 SIGCOMM.Google Scholar
- Thomas Fenz, Klaus-Tycho Foerster, Stefan Schmid, and Ana"is Villedieu. 2019. Efficient Non-Segregated Routing for Reconfigurable Demand-Aware Networks. In IFIP Networking.Google Scholar
- Klaus-Tycho Foerster, Manya Ghobadi, and Stefan Schmid. 2018. Characterizing the Algorithmic Complexity of Reconfigurable Data Center Architectures. In ANCS.Google Scholar
- Michael R Garey and David S Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman San Francisco (1979).Google Scholar
- Monia Ghobadi, Ratul Mahajan, Amar Phanishayee, Houman Rastegarfar, Pierre-Alexandre Blanche, Madeleine Glick, Daniel Kilper, Janardhan Kulkarni, Gireeja Ranade, and Nikhil Devanur. 2016. ProjecToR: Agile Reconfigurable Datacenter Interconnect. In SIGCOMM.Google Scholar
- Albert Greenberg, James R Hamilton, Navendu Jain, Srikanth Kandula, Changhoon Kim, Parantap Lahiri, David A Maltz, Parveen Patel, and Sudipta Sengupta. 2009. VL2: A Scalable and Flexible Data Center Network. In SIGCOMM.Google Scholar
- Daniel Halperin, Srikanth Kandula, Jitendra Padhye, Paramvir Bahl, and David Wetherall. 2011. Augmenting Data Center Networks with Multi-gigabit Wireless Links. In SIGCOMM.Google Scholar
- Navid Hamedazimi, Zafar 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 SIGCOMM.Google Scholar
- Kai Han, Zhiming Hu, Jun Luo, and Liu Xiang. 2015. RUSH: RoUting and Scheduling for Hybrid Data Center Networks. In INFOCOM.Google Scholar
- Keqiang He, Eric Rozner, Kanak Agarwal, Wes Felter, John Carter, and Aditya Akella. 2015. Presto: Edge-based Load Balancing for Fast Datacenter Networks. ACM SIGCOMM Computer Communication Review, Vol. 45, 4 (2015), 465--478.Google Scholar
Digital Library
- Martin Hoefer, Thomas Kesselheim, and Berthold Vöcking. 2011. Approximation Algorithms for Secondary Spectrum Auctions. In SPAA.Google Scholar
- Martin Hoefer, Thomas Kesselheim, and Berthold Vöcking. 2014. Approximation Algorithms for Secondary Spectrum Auctions. ACM Transactions on Internet Technology (TOIT), Vol. 14, 2--3 (2014), 16.Google Scholar
Digital Library
- Christian E Hopps. 2000. Analysis of An Equal-Cost Multi-Path Algorithm. RFC 2992, IETF (2000).Google Scholar
- Kamal Jain, Jitendra Padhye, Venkata N. Padmanabhan, and Lili Qiu. 2003. Impact of Interference on Multi-hop Wireless Network Performance. In MOBICOM.Google Scholar
- Srikanth Kandula, Dina Katabi, Shantanu Sinha, and Arthur Berger. 2007. Dynamic Load Balancing without Packet Reordering. ACM SIGCOMM Computer Communication Review, Vol. 37, 2 (2007), 51--62.Google Scholar
Digital Library
- Srikanth Kandula, Sudipta Sengupta, Albert Greenberg, Parveen Patel, and Ronnie Chaiken. 2009. The Nature of Data Center Traffic: Measurements & Analysis. In IMC.Google Scholar
- Jonathan A Kelner, Yin Tat Lee, Lorenzo Orecchia, and Aaron Sidford. 2014. An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations. In SODA.Google Scholar
- 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 SIGCOMM.Google Scholar
- Nithin Michael and Ao Tang. 2014. Halo: Hop-by-Hop Adaptive Link-State Optimal Routing. IEEE/ACM Transactions on Networking, Vol. 23, 6 (2014), 1862--1875.Google Scholar
Digital Library
- Prabhakar Raghavan and Clark D Tompson. 1987. Randomized Rounding: A Technique for Provably Good Algorithms and Algorithmic Proofs. Combinatorica (1987).Google Scholar
- Arjun Roy, Hongyi Zeng, Jasmeet Bagga, George Porter, and Alex C Snoeren. 2015. Inside the Social Network's (Datacenter) Network. In SIGCOMM.Google Scholar
- Stefan Schmid, Chen Avin, Christian Scheideler, Michael Borokhovich, Bernhard Haeupler, and Zvi Lotker. 2016. SplayNet: Towards Locally Self-Adjusting Networks. IEEE/ACM Transactions on Networking (ToN), Vol. 24, 3 (2016), 1421--1433.Google Scholar
Digital Library
- Siddhartha Sen, David Shue, Sunghwan Ihm, and Michael J Freedman. 2013. Scalable, Optimal Flow Routing in Datacenters via Local Link Balancing. In CoNEXT.Google Scholar
- Ji-Yong Shin, Emin Gn Sirer, Hakim Weatherspoon, and Darko Kirovski. 2013. On the feasibility of completely wirelesss datacenters. IEEE/ACM Transactions on Networking (ToN), Vol. 21, 5 (2013), 1666--1679.Google Scholar
Digital Library
- Arjun Singh, Joon Ong, Amit Agarwal, Glen Anderson, Ashby Armistead, Roy Bannon, Seb Boving, Gaurav Desai, Bob Felderman, Paulie Germano, et almbox. 2015. Jupiter Rising: A Decade of Clos Topologies and Centralized Control in Google's Datacenter Network. In SIGCOMM.Google Scholar
- Erico Vanini, Rong Pan, Mohammad Alizadeh, Parvin Taheri, and Tom Edsall. 2017. Let It Flow: Resilient Asymmetric Load Balancing with Flowlet Switching. In NSDI.Google Scholar
- Peng-Jun Wan. 2009. Multiflows in Multihop Wireless Networks. In MobiHoc.Google Scholar
- Guohui Wang, David G Andersen, Michael Kaminsky, Konstantina Papagiannaki, TS Ng, Michael Kozuch, and Michael Ryan. 2010. c-Through: Part-time Optics in Data Centers. In SIGCOMM.Google Scholar
- Mowei Wang, Yong Cui, Shihan Xiao, Xin Wang, Dan Yang, Kai Chen, and Jun Zhu. 2018. Neural Network Meets DCN: Traffic-driven Topology Adaptation with Deep Learning. Proceedings of the ACM on Measurement and Analysis of Computing Systems, Vol. 2, 2 (2018), 26.Google Scholar
Digital Library
- Yiting Xia, Xiaoye Steven Sun, Simbarashe Dzinamarira, Dingming Wu, Xin Sunny Huang, and TS Ng. 2017. A Tale of Two Topologies: Exploring Convertible Data Center Network Architectures with Flat-tree. In SIGCOMM.Google Scholar
- Zhenjie Yang, Yong Cui, Xin Wang, Yadong Liu, Minming Li, and Zhixing Zhang. 2019. Towards Maximal Service Profit in Geo-Distributed Clouds. In IEEE ICDCS.Google Scholar
- Jin Y Yen. 1971. Finding the K Shortest Loopless Paths in a Network. Management Science, Vol. 17, 11 (1971), 712--716.Google Scholar
Digital Library
- Junlan Zhou, Malveeka Tewari, Min Zhu, Abdul Kabbani, Leon Poutievski, Arjun Singh, and Amin Vahdat. 2014. WCMP: Weighted Cost Multipathing for Improved Fairness in Data Centers. In EuroSys.Google Scholar
Digital Library
- Xia Zhou, Zengbin Zhang, Yibo Zhu, Yubo Li, Saipriya Kumar, Amin Vahdat, Ben Y Zhao, and Haitao Zheng. 2012. Mirror Mirror on the Ceiling: Flexible Wireless Links for Data Centers. In SIGCOMM.Google Scholar
- Yibo Zhu, Xia Zhou, Zengbin Zhang, Lin Zhou, Amin Vahdat, Ben Y Zhao, and Haitao Zheng. 2014. Cutting the Cord: a Robust Wireless Facilities Network for Data Centers. In MOBICOM.Google Scholar
Index Terms
Achieving Efficient Routing in Reconfigurable DCNs
Recommendations
Achieving Efficient Routing in Reconfigurable DCNs
SIGMETRICS '20: Abstracts of the 2020 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer SystemsWith the fast growth of cloud services and network scales, the heavy and highly dynamic traffic demands pose great challenges to the efficient traffic engineering in today's data center networks (DCNs) [21]. The DCN flows can be broadly classified into ...
Achieving Efficient Routing in Reconfigurable DCNs
With the fast growth of cloud services and network scales, the heavy and highly dynamic traffic demands pose great challenges to the efficient traffic engineering in today's data center networks (DCNs) [21]. The DCN flows can be broadly classified into ...
Two phase load balanced routing using OSPF
The Internet traffic is growing, and its nature changes because of new applications. Multimedia applications require bandwidth reservations that were not needed initially when the file transfers dominated the Internet. P2P applications are making ...






Comments