Abstract
The authors consider the reliability of fail-soft ring networks using as a measure the probability that all operative nodes can communicate P(C). Although computing P(C) is in general an NP-hard problem, it is shown that, for ring networks, closed-form expressions can be derived in terms of the failure probabilities of nodes, links, and switches (the configuration components used in attempts to achieve fail-soft operation of the rings). The authors derive closed-form expressions of P(C) for five simplex rings: (1) the basic unidirectional ring, (2) rings with nodal bypass switches, (3) rings with both bypass switches and a standby ring, (4) rings with self-heal switches, and (5) star-shaped rings. The expressions for these five rings are evaluated under varying failure probability assumptions, and reliability comparisons are made. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
