Hamiltonian properties of HCN and BCN networks

Data center network plays an important role in improving the performance of cloud computing. Hamiltonian properties and Hamiltonian connectivity have important applications in communication network. The existence of Hamiltonian path can make the network more efficient communication. HCN and BCN networks are two important data center networks with nice routing performance and excellent scalability. In this paper, we study the Hamiltonian properties and disjoint path covers of these two networks. Firstly, we prove that HCN(n, h) is Hamiltonian-connected with n >= 4 and h >= 0. Secondly, we prove that BCN(alpha, beta, h, gamma) is Hamiltonian-connected with h < gamma, alpha >= 4, beta >= 1, h >= 0, gamma >= 0. Finally, we design Hamiltonian path construction algorithms for HCN and BCN networks. Simulation experiments verify the construction process of Hamiltonian path. Moreover, the running time of the routing algorithm designed in this study is compared with the classical shortest path multicast tree algorithm DijkstraSPT, and its running time is lower than that of the algorithm DijkstraSPT by about 5ms on different server nodes, which shows that the routing algorithm designed in this study according to HCN and BCN structure operate efficiently.