Title :
Ring network reliability-the probability that all operative nodes can communicate
Author :
Lin, Nanchang ; Silio, Charles B., Jr.
Author_Institution :
Dept. of Electr. Eng., Maryland Univ., College Park, MD, USA
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
Keywords :
computer networks; fault tolerant computing; NP-hard problem; closed-form expressions; configuration components; fail-soft ring networks; failure probability assumptions; nodal bypass switches; operative nodes; probability; reliability comparisons; self-heal switches; simplex rings; standby ring; star-shaped rings; unidirectional ring; Bandwidth; Communication networks; Communication switching; Computer networks; Educational institutions; Electric variables measurement; NP-hard problem; Optical fibers; Switches; Telecommunication network reliability;
Conference_Titel :
Reliable Distributed Systems, 1989., Proceedings of the Eighth Symposium on
Conference_Location :
Seattle, WA
Print_ISBN :
0-8186-1981-3
DOI :
10.1109/RELDIS.1989.72749
