Abstract
A funtamental consideration in the design of a computer network is the determination of its overall reliability. For large computer networks the exact evaluation of overall reliability is prohibitive because of the complexity of the computations involved. In this paper an approximate technique for the overall reliability determination is proposed which is based on the m-hierarchical clustering of a network. By this approach a close lower bound for the exact overall reliability can always be obtained with important savings in computation time and available memory.
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.
