Name
Abstract | ||
|---|---|---|
The ability of a network to maintain its function in the face of outages caused by node failures is defined as fault tolerance and the component connectivity is a good indicator to measure the fault tolerance of network. The fault-tolerant routing algorithm based on component connectivity plays an important role in ensuring network reliability. The r-dimensional generalized hypercube G (m(r), m(r-1, ...,) m(1)) is an important topological structure, which has a small diameter, easy-to-construct connection mode and recursive structure. In this paper, for G (m(r), m(r-1, ...,) m(1)), firstly we study 3component connectivity and propose a fault-tolerant routing algorithm based on 3-component connectivity. We denote the 3-component connectivity of the generalized hypercube as c kappa(3) (G) and prove c kappa(3) (G) = 2 kappa(G) - 2, where kappa(G) is the classic connectivity of the r-dimensional generalized hypercube. Then based on the 3-component connectivity, we propose an O (kappa (G)(3)) fault-tolerant routing algorithm GHCCP, which can construct at least one fault-free path between any two distinct fault-free vertices. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1109/ISPA-BDCloud-SocialCom-SustainCom52081.2021.00181 | 19TH IEEE INTERNATIONAL SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING WITH APPLICATIONS (ISPA/BDCLOUD/SOCIALCOM/SUSTAINCOM 2021) |
Keywords | DocType | ISSN |
Component connectivity, Generalized hypercubes, Routing algorithm, Fault-tolerant routing | Conference | 2158-9178 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chang Shu | 1 | 0 | 0.34 |
| Yan Wang | 2 | 4 | 2.08 |
| Jianxi Fan | 3 | 718 | 60.15 |
| Huanwen Zhang | 4 | 0 | 0.34 |