Hierarchical interconnection networks with folded hypercubes as basic clusters

The paper introduces a class of hierarchical interconnection networks, which is suitable for multicomputer systems. These networks, to which we give the name HFCube, employ the folded hypercube as a basic cluster, connect many such clusters using a complete graph, and maintain node connectivity to be the same for all nodes of the graph. We present all optimal routing algorithms for the HFCube. In addition, we investigate the properties of the HFCube and show that the HFCube exhibits cost effectiveness, compared to other hierarchical networks.