Abstract
This paper presents a method to find the frequency and duration of outage of large complex networks through the network approach. Unreliable nodes can be considered. Numerical examples are given to elucidate the theory. The results from this technique are fairly accurate. A feature of the method is that it can handle large systems having reliable nodes with a present day computer. Even for those systems which contain unreliable nodes, the number of combinations of unreliable nodes required is much less than the number of terms needed by any path or cutset enumeration method. The use of delta-star transformations introduces some error in the results, but the error is small enough as seen from the numerical values for the examples solved in this paper.
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.
