Hyper Petersen network: a fault-tolerant multiprocessor topology

The authors propose and analyze a new hypercube-like 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, high degree of symmetry and connectivity, and small diameter. For example, an n-dimensional HP network with N=1.25*2ⁿ nodes is a regular graph having degree δ=n, node-connectivity κ=n, and diameter d=n-1, whereas a binary hypercube graph with the same diameter covers only 2^n-1 nodes, each of degree (n-1). Thus the HP topology covers 2.5 times extra nodes at the cost of increasing the degree by one. Again with the same degree and connectivity, the diameter of HP network is one less than that of a hypercube, yet having 1.25 times larger packing density. Furthermore, various topologies such as meshes, trees, and twisted hypercubes can be embedded on the HP topology