Abstract
A global reliability measure called 'network reliability' (NR) is the probability that a call entering a probabilistic network at any originating node can reach every other node. This concept is quite useful in multiterminal networks such as computer networks and parallel processors, etc. A simple technique is presented for evaluating NR in symbolic form. The method is based on cutsets and is computationally advantageous with respect to the spanning tree approach. It requires fewer cutsets to be manipulated in the process of determining the NR expression. The number of cutsets is approximately half that of spanning trees even for a small sized computer communication network and there is a further improvement in the situation for larger networks.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.