Reliability analysis of the cactus-based networks

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 C N n . 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.