The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Neste artigo, uma nova estrutura de rede denominada redes hierárquicas completamente conectadas generalizadas (HCCs) é proposta, e suas propriedades e características são avaliadas. Estratégias de roteamento simples para HCCs também são desenvolvidas para algoritmos de roteamento de caminhos mais curtos. Um conjunto de HCCs construídos pelo método proposto inclui algumas redes hierárquicas convencionais, então é denominado generalizado. A construção de um HCC começa a partir de um bloco básico (um bloco de nível 1) que consiste em n nós de grau constante. Então um nível-h bloquear para h
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.
Copiar
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
URL: https://global.ieice.org/en_transactions/information/10.1587/e83-d_6_1216/_p
Copiar
@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
keywords={},
doi={},
ISSN={},
month={June},}
Copiar
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
ER -