Novel hierarchical interconnection networks for high-performance multicomputer systems

This paper proposes several novel hierarchical interconnection networks based on Heawood graphs, namely, folded Heawood networks, root-folded Heawood networks, recursively expanded Heawood networks, and flooded Heawood networks. Like hypercubes and networks extended from Petersen networks, these hierarchical Heawood networks have the following properties: regular topology, high scalability, and small diameter. Due to these important properties, these hierarchical Heawood networks seem to have potential as alternatives for future interconnection structures of multicomputer systems. Furthermore, this paper will demonstrate that the routing and broadcasting algorithms for these proposed networks are as elegant as the algorithms for hypercubes and Petersen-based networks.