Hyper Petersen network: yet another hypercube-like topology

The authors propose and analyze a new hypercubelike topology, called the hyper-Petersen (HP) network, which is constructed from the Cartesian product of a binary hypercube and the Petersen graph. The properties of HP topology include regularity, a high degree of symmetry and connectivity, and a small diameter. For example, it is shown that an n-dimensional HP network with N=1.25×2ⁿ nodes covers 2.5 times more nodes than the binary hypercube at the cost of increasing the degree by one. Furthermore, with the same degree and connectivity, the diameter of the HP network is one less than that of a hypercube, yet it has a 1.25 times higher packing density. The authors also discuss the embedding of various other topologies such as meshes, trees, and twisted hypercubes on the HP, thereby emphasizing its rich interconnection structure with a simple routing scheme for message communication. A ring of odd length can be embedded in an HP network, which is a limitation of a binary hypercube