Abstract
In this paper the overall reliability of mch-level hierarchical computer networks is evaluated. This is an extension of an earlier work wherein two level hierarchical clustrering structures were examined [4]. The method presented first enumerates all the minimal cutsets and then very efficiently evaluates the overall network reliability. There are important savings in computation time and available memory, as the main idea behind the hierarchical design is to impose a decomposable structure which will result in a set of smaller subproblems. The developed technique is very useful in the overall reliability evaluation of large computer networks or many interconnected networks.
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.
