Abstract
This paper determines the overall reliability of a computer network in which hierarchical routing strategies are used for the communication between its nodes. An exact method is presented which is followed by three fast computer techniques corresponding to three different routing policies. The first two give the exact value for the overall reliability while the third provides a lower bound which is very close to the exact reliability value. The main advantages of these techniques are the important savings in computation time and available memory. The developed algoriths are very useful in the overall reliability evaluation of large networks or many interconnected subnetworks.
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.
