Constructing Two Edge-Disjoint Hamiltonian Cycles in BCube Data Center Networks for All-to-All Broadcasting

The rapid growth in demand for diverse network application services has driven the continuous development and expansion of data centers. BCubes was proposed by Microsoft Research Asia for designing modular data centers, and it is a multi-layer recursively constructed network with many advantages. This article shows that BCube is the existence of two edge-disjoint Hamiltonian cycles, abbreviated as two EDHCs, which provide two significant benefits in data center operations: (1) parallel data broadcast and (2) edge fault-tolerance in network communications. We present the following results in this paper: (1) By utilizing the network topology characteristics, we first provide construction algorithms for two EDHCs on low-dimensional BCubes. (2) Based on the algorithm and the recursive structure of BCubes, we prove that two EDHCs exist for all BCubes. (3) Considering all-to-all broadcasting using two EDHCs as transmission channels, we evaluate the performance of all-to-all broadcasting through simulations on low-dimensional BCubes.