Abstract
A philosophy for developing an algorithm to compute collectively the required reliabilities of the components in a network so as to satisfy the specified reliabilities of an arbitrary number of source-destination pairs is presented. This philosophy involves the formulation and solution of an entropy maximization problem. The resulting algorithm is easy to implement and can become a very valuable tool for estimating network component reliability requirements quickly. If the number of components whose reliabilities are to be computed becomes extremely large, so that the solution of the corresponding entropy maximization problem becomes difficult, the algorithm can be applied iteratively to generate results.
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.
