Some properties and algorithms for the hyper-torus network

Kim, Jong-Seok; Kim, Sung Won; Qiu, Ke; Lee, Hyeong-Ok

doi:10.1007/s11227-014-1130-0

Cited by 2 publications

(1 citation statement)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, there are ways to reduce the number of degree of the interconnection network, change the node edge definition, use a structure with a short diameter, and layer the interconnection network structure. Toroidal mesh [19], Diagonal mesh [19], Honeycomb mesh [18], Petersen-torus [21], Hyper-torus [20], Semi-diagonal torus [17] are networks that improve the diameter of the constant degree graph have been proposed [25].…”

Section: Figurementioning

confidence: 99%

Fault Tolerance and Node Mapping Algorithm Hierarchical Graph HCN

Park,

Lee

2023

ijmst

View full text Add to dashboard Cite

Embedding in an interconnection network maps the interconnection network G to H and analyzes the relationship between G and H. Hypercubes and toruses are widely known as interconnection networks, and various algorithms have been developed. The HCN graph is a network with a hierarchical structure to improve the network cost of hypercube. In this study, we analyze the fault tolerance and embedding properties of HCN graphs. As a result of the research, the HCN graph has the same node connectivity and degree, so it has the maximum fault tolerance property. In addition, an algorithm that can one-to-one node map the HCN structure to the torus structure was proposed. The embedding results showed that it was possible to embed the torus structure in the HCN graph at an extension rate of 3 and dilation of 1. The results of the embedding study mean that various algorithms developed in Torus can be efficiently used in the HCN structure.

show abstract