Table of Contents Author Guidelines Submit a Manuscript
VLSI Design
Volume 1 (1993), Issue 1, Pages 61-70

Conditional Disconnection Probability in Star Graphs

Department of Computer Science, Colorado State University, Ft. Collins, Colorado, USA

Copyright © 1993 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Recently a new interconnection topology has been proposed which compares very favorably with the well known n-cubes (hypercubes) in terms of degree, diameter, fault-tolerance and applicability in VLSI design. In this paper we use a new probabilistic measure of network fault tolerance expressed as the probability of disconnection to study the robustness of star graphs. We derive analytical approximation for the disconnection probability of star graphs and verify it with Monte Carlo simulation. We then compare the results with hypercubes [4]. We also use the measures of network resilience and relative network resilience to evaluate the effects of the disconnection probability on the reliability of star graphs.