Abstract
The generalized hypercube (GH) is one key interconnection network with excellent topological properties. It not only contains many other interconnection topologies, but also can be used to construct some data center networks, such as HyperX, BCube, FBFLY, and SWCube. However, the construction cost of GH is high since there are too many links in it. Therefore, in this paper, we propose a novel low cost interconnection architecture called the exchanged generalized hypercube (EGH). We study the properties of EGH, such as the number of edges, the degree of vertices, connectivity, diameter, and diagnosability. Then, we give a routing algorithm to find the shortest path between any two distinct vertices of EGH. Furthermore, we design an algorithm to give disjoint paths between any two distinct vertices of EGH. In addition, we propose two local diagnosis algorithms in EGH under PMC model and MM model, respectively. Simulation results demonstrate that even if the proportion of faulty vertices in EGH is up to 25%, the probability that these two diagnosis algorithms can successfully judge the status of vertices is more than 90%. The analysis shows that the construction cost of EGH is much less than GH.
Funding Information
  • National Natural Science Foundation of China (61572337, 61872257)
  • Natural Science Research of Jiangsu Higher Education Institutions of China (18KJA520009)
  • Application Foundation Research of Suzhou of China (SYG201653)
  • Priority Academic Program Development of Jiangsu Higher Education Institutions

This publication has 41 references indexed in Scilit: