Abstract
An important parameter in the topological design of computer communication networks is that of overall reliability, rather than terminal-pair reliability, as one is interested in not allowing service disruption between any pair of nodes. Exact techniques for overall reliability evaluation based on the spanning trees idea fail for networks even of reasonable size because of the enormous amount of computer time and storage required. In this paper, we present a very simple and fast method based on an m-level hierarchical clustering (MHC) for network overall reliability evaluation which gives results as good as exact techniques for realistic values of link reliability (e.g. 0.9 or more). Adaptability of a practical clustering method (i.e. complete linkage, CL) to obtain near optimal clusters for overall reliability evaluation by incorporating suggested modifications is proposed.
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.
