The search functionality is under construction.

The search functionality is under construction.

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* *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

- Publicized

- Online ISSN

- DOI

- Type of Manuscript
- PAPER

- Category
- Computer Systems

The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.

Copy

Toshinori TAKABATAKE, Keiichi KANEKO, Hideo ITO, "HCC: Generalized Hierarchical Completely-Connected Networks" in IEICE TRANSACTIONS on Information,
vol. E83-D, no. 6, pp. 1216-1224, June 2000, doi: .

Abstract: 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* *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.

URL: https://global.ieice.org/en_transactions/information/10.1587/e83-d_6_1216/_p

Copy

@ARTICLE{e83-d_6_1216,

author={Toshinori TAKABATAKE, Keiichi KANEKO, Hideo ITO, },

journal={IEICE TRANSACTIONS on Information},

title={HCC: Generalized Hierarchical Completely-Connected Networks},

year={2000},

volume={E83-D},

number={6},

pages={1216-1224},

abstract={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* *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.

keywords={},

doi={},

ISSN={},

month={June},}

Copy

TY - JOUR

TI - HCC: Generalized Hierarchical Completely-Connected Networks

T2 - IEICE TRANSACTIONS on Information

SP - 1216

EP - 1224

AU - Toshinori TAKABATAKE

AU - Keiichi KANEKO

AU - Hideo ITO

PY - 2000

DO -

JO - IEICE TRANSACTIONS on Information

SN -

VL - E83-D

IS - 6

JA - IEICE TRANSACTIONS on Information

Y1 - June 2000

AB - 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* *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.

ER -