Abstract

The purpose of this paper is to propose a computational technique for evaluating the reliability of networks subject to stochastic failures. In this computation, a mathematical model is provided using a technique which incorporates the effect of the factoring decomposition theorem using polygon-to-chain and series-parallel reductions. The algorithm proceeds by identifying iteratively one of seven polygons and when it is discovered, the polygon is immediately removed and replaced by a simple chain after having changed the individual values of the reliability of each edge and each node of the polygon. Theoretically, the mathematical development follows the results presented by Satyanarayana & Wood and Theologou & Carlier. The computation process is recursively performed and less constrained in term of execution time and memory space, and generates an exact value of the reliability.

Highlights

  • Over the last decades, the reliability evaluation of systems and networks has become a priority for all manufacturers, in areas when human life is at stake

  • The purpose of this paper is to propose a computational technique for evaluating the reliability of networks subject to stochastic failures

  • The reliability evaluation of systems and networks has become a priority for all manufacturers, in areas when human life is at stake

Read more

Summary

Introduction

The reliability evaluation of systems and networks has become a priority for all manufacturers, in areas when human life is at stake. The problem of evaluating the reliability of networks has been verified to be NP-hard [28] and to be a counting problem or #-P-complete (number P-complete) problem ([28] [29] [30]) To avoid such complexity, several methods and techniques have been proposed, such as factoring and reductions algorithms. Almost in the same time other researchers proposed a new category of methods which combines the factoring theorem and reduction operations using an efficient procedure that transforms a polygon structure into a simple chain and from which it becomes very easy to determine the reliability [2] [15] [16] [21] [23] [30] [33] [34] [35].

Basic Knowledge
The Factoring Principle
Polygon-to-Chain Reduction
Algorithm Description
Application
Conclusion
Full Text
Paper version not known

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 call

Disclaimer: 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.