RUSH: Routing and scheduling for hybrid data center networks

• Published in: 2015 IEEE Conference on Computer Communications (INFOCOM) pp. 415 - 423
• Main Authors: Kai Han, Zhiming Hu, Jun Luo, Liu Xiang
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.04.2015
• Subjects: Algorithm design and analysis; Computers; Directional antennas; Routing; Schedules; Topology; Wireless communication
• ISSN: 0743-166X; 2641-9874
• DOI: 10.1109/INFOCOM.2015.7218407

The recent development of 60GHz technology has made hybrid Data Center Networks (hybrid DCNs) possible, i.e., augmenting wired DCNs with highly directional 60GHz wireless links to provide flexible network connectivity. Although a few recent proposals have demonstrated the feasibility of this hybrid design, it still remains an open problem how to route DCN traffics with guaranteed performance under a hybrid DCN environment. In this paper, we make the first attempt to tackle this challenge, and propose the RUSH framework to minimize the network congestion in hybrid DCNs, by jointly routing flows and scheduling wireless (directional) antennas. Though the problem is shown to be NP-hard, the RUSH algorithms offer guaranteed performance bounds. Our algorithms are able to handle both batched arrivals and sequential arrivals of flow demands, and the theoretical analysis shows that they achieve competitive ratios of O(log n), where n is the number of switches in the network. We also conduct extensive simulations using ns-3 to verify the effectiveness of RUSH. The results demonstrate that RUSH produces nearly optimal performance and significantly outperforms the current practice and a simple greedy heuristics.