DocumentCode :
1014364
Title :
Consecutive-2-of-n:F systems with node and link failures
Author :
Chen, R.W. ; Hwang, F.K. ; Li, Wen-Ching Winnie
Author_Institution :
Dept. of Math., Miami Univ., Coral Gables, FL, USA
Volume :
42
Issue :
3
fYear :
1993
fDate :
9/1/1993 12:00:00 AM
Firstpage :
497
Lastpage :
502
Abstract :
It has always been assumed that nodes can fail but not links, although most examples given for the consecutive-k-out-of-n :F system show no reason for such an assumption. The system described not only allows links to fail, but allows both nodes and links to fail, with distinct probabilities. For the k=2 case, the authors set up recursive equations for system reliability, and give a closed-form solution. It is proved that for n large, the reliability is decreasing in n (with one exceptional case) and higher reliability should be provided to the nodes, and then to the longer links rather than to shorter links
Keywords :
failure analysis; probability; reliability theory; closed-form solution; consecutive-k-out-of-n:F system; link failures; node failures; recursive equations; reliability; Airports; Closed-form solution; Equations; Newton method; Polynomials; Telephony; Wires;
fLanguage :
English
Journal_Title :
Reliability, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9529
Type :
jour
DOI :
10.1109/24.257838
Filename :
257838
Link To Document :
بازگشت