HCC: Generalized Hierarchical Completely-Connected Networks

Toshinori TAKABATAKE, Keiichi KANEKO, Hideo ITO

Summary :

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 2 is constructed recursively by interconnecting any pair of macro nodes (n level-(h-1) blocks) completely. An HCC has a constant node-degree regardless of an 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.

• Publication: IEICE TRANSACTIONS on Information Vol.E83-D No.6 pp.1216-1224
• Publication Date: 2000/06/25
• Type of Manuscript: PAPER
• Category: Computer Systems

Authors

Toshinori TAKABATAKE
Keiichi KANEKO
Hideo ITO

Keyword

interconnection networks,  generalized network, hierarchical network,  completely-connected network,  routing strategy