Hierarchical Interconnection Networks with Folded Hypercubes as Basic Chusters

摘要

This paper introduces a class of hierarchical interconnection networs, 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 the node connectivity to be the same for all nodes of the graph. We present an optimal routing algorithm for the HFCube. In addition, we investigate the properties of the HFCube and show that the HFCube exhibits cost effcetive compared to other hierarchical networks.