Loading...
Please wait, while we are loading the content...
Similar Documents
HCC: generalized hierarchical completely-connected networks
| Content Provider | Semantic Scholar |
|---|---|
| Author | Takabatake, Toshinori Kaneko, Keiichi Ito, Hideo |
| Copyright Year | 2000 |
| 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 ≥ 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. key words: interconnection networks, generalized network, hierarchical network, completely-connected network, routing strategy |
| Starting Page | 1216 |
| Ending Page | 1224 |
| Page Count | 9 |
| File Format | PDF HTM / HTML |
| Volume Number | 83 |
| Alternate Webpage(s) | http://web.tuat.ac.jp/~k1kaneko/papers/j10.pdf |
| Alternate Webpage(s) | http://www.tuat.ac.jp/~k1kaneko/papers/j10.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |