Abstract
In this paper the inclusion and exclusion approach was used to calculate the reliability expression for the Advanced Research Projects Agency Network (ARPANET). The policy entails the use of either a path group or a segment set. Additionally, the paper deals with a computationally efficient and easy-to-concept method for obtaining minimum path sets using the powers of a network connection matrix. The method is simple and computationally efficient, and it can be used on graphs with finite non-zero failure probabilities in both nodes and branches. The method makes use of Boolean algebra and graph theory principles. The method is demonstrated with an example.
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.
