HyperDC: A Re-Arrangeable Non-Blocking Data Center Networks Topology

In this paper, an re-arrangeable topology of data center networks is presented which is called HyperDC. Combining the merits of k-dilated, k-bristled and k-ary hypercube topology, this work introduces the definition of HyperDC topology in the view of graph theory; Using the mathematical induction, the properties of HyperDC is analyzed especially the part of re-arrangeable non-blocking property, which benefits line speed transmission of flow and simplification of cache mechanism in data center networks. Furthermore, the optimal embedment of many other topologies into HyperDC is realized, which also benefits the realization of a large number of parallel algorithms and stimulations of many other topologies in HyperDC; Finally, Compare with several different topologies, the property of re-arrangeable non-blocking in the aspects of latency, link complexity, switch complexity and scalability, which proves superior features in HyperDC topology.