Hyper-DC: A rearrangeable non-blocking data center networks topology

Abstract

In this paper it introduces a rearrangeable non-blocking topology of data center networks called Hyper-DC. Firstly, combining the merits of k-dilated k-bristled hypercube topology and k-ary hyper-mesh topology, this paper introduces the definition of Hyper-DC topology in the view of graph theory; Secondly, it analyzes properties of Hyper-DC topology especially proving rearrangeable non-blocking property by the mathematical induction, which benefits line speed transmission of flow and simplification of cache mechanism in data center networks; Thirdly, this paper realizes the optimal embedment of many other topologies into Hyper-DC, which benefits the realization of a large number of parallel algorithms and stimulations of many other topologies; Finally, it compares with several topologies which have rearrangeable non-blocking property in the aspects of properties of latency, link complexity, switch complexity and scalability.