Abstract
Ahmad (1982) has published a technique to compute the reliability of a network without resorting to paths or cutsets. However, the technique uses a random choice of next node connected to the previous node in the construction of a tree. This approach can lead to a large number of terms in the reliability expression. Our modified version of the Ahmad technique always produces a reliability expression with the same or fewer terms as the original technique.
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.
