Abstract
A formula that uses K-minimal Eulerian circuits and the inclusion-exclusion property to efficiently compute K-terminal reliability R/sub K/(G) for ring networks is presented. This formula is applied to three fiber distributed data interface (FDDI) ring network topologies, and it is shown that the time complexity of computing each K-terminal reliability expression is polynomially bounded. The applicability of the authors' approach is illustrated by deriving a closed-form expression of R/sub K/(G) for the FDDI double-ring topology in terms of the failure probabilities of links, network ports, and station common units. >
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.
