Abstract
This paper determines the overall reliability of computer networks in which m-level hierarchical routing strategies are used for the communication between their nodes. Also, the clusters have dynamic boundaries, i.e. when a cluster is decomposed the network reacts by reorganizing itself into a new set of clusters in order to continue to communicate, if possible, with the components of the decomposed subnetwork. The proposed method first enumerates all the minimal cutsets and then evaluates very efficiently the overall reliability. The presented technique is very useful when large computer networks or many interconnected networks are examined.
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.
