HCC: Generalized hierarchical completely-connected networks
In this paper, a new network structure called generalized Hierarchical Completely-Connected networks (HCCs) is proposed, and its properties and features are evaluated. Simple routing strategies for HCCs are also developed for shortest-paths routing algorithms. A set of HCCs constructed by the proposed method includes some conventional hierarchical networks, then it is called generalized one. The construction of an HCC starts from a basic block (a level-1 block) which consists of n nodes of constant degree. Then a level-h block for h greater than or equal to 2 is constructed recursively Ly interconnecting any pair of macro nodes (n level-(h - 1) blocks) completely. An HCC has a constant node-degree regardless of art increase in its size (the number of nodes). Furthermore, since an HCC has a hierarchically structured topology and the feature of uniformity, a wide variety of inter-cluster connections is possible. Evaluation results show that an HCC is suitable for very large computer systems.
completely-connected network routing strategy hierarchical network interconnection networks generalized network