Network resilience of star graphs
Walid A. Najjar, Pradip K. Srimani · 1991
Star graphs have been proposed as network topologies for the interconnection of multicomputer systems.They have been shown to compare very favorably with binary n-cubes networks (hypercubes) in terms of degree, diameter, fault-tolerance and applicability in VLSI design.In this paper we study some fault-tolerance properties of star graphs with a specific focus on their network resilience.Network resilience is a measure of the robustness of a network that is based on the probability of occurrence of a network partition as a result of multiple node failures.We derive an approximate analytical expression for the probability of a network disconnection in star graphs that is verified using a Monte.Carlo simulation.The results are compared and contrasted with those obtained for hypercubes and other networks [4].These results show that, unlike other networks, the resilience of star graphs stays constant as the network size is increased.