Name
Abstract | ||
|---|---|---|
The attackers may have a tendency of targeting on a vulnerable network due to the fact that the cost of this attack is lower and the probability of successful attack is higher. Therefore, in order to enhance the invulnerability of a network, designers of massively networked multiprocessor systems concentrate on the robustness and reliability of the network. Connectivity and diagnosability are two significant indicators to measure the anti-attack ability of a network. In this paper, we introduce a novel class of topological structure based on group theory, the n-dimensional cactus-based network, denoted by CNn. Then we show the characterization of algebraic and combinatorial properties for the cactus network as well as its connectivity, super connectivity, extra connectivity and corresponding diagnosabilities. (C) 2021 Elsevier B.V. All rights reserved. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1016/j.tcs.2021.07.029 | THEORETICAL COMPUTER SCIENCE |
Keywords | DocType | Volume |
Multiprocessor systems, Cactus-based network, Connectivity, Extra connectivity, Diagnosability | Journal | 888 |
ISSN | Citations | PageRank |
0304-3975 | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jiafei Liu | 1 | 0 | 2.03 |
| Shuming Zhou | 2 | 36 | 14.36 |
| Eddie Cheng | 3 | 511 | 37.86 |
| Qianru Zhou | 4 | 0 | 3.04 |
| Xiaoqing Liu | 5 | 0 | 0.34 |