M.L. Kansal and S. Verma

System failure assessment, minimal system cutsets, saturated net-work, complete graph, unsaturated networks

In most practical networks, an important measure of reliability is the estimation of probability that each and every node remains connected to another node or nodes of the network. As the number of nodes increases, the number of branches in a saturated network grows to ^{n}C_{2}, thereby increasing the number of ways a network is in up or down state(s). As the size of the network increases, the estimation of success combinations of branches increases and thus computational effort increases. In such situations, it is easier to assess the performance of a network by determining the probability of network failure through system cutsets. This paper presents an efficient technique for identifying the system failure conditions based on the generation of minimal system cutsets. The technique is efficient and useful, as it identiļ¬es only the necessary and sufficient minimal ways of system failure, which are many fewer than the spanning trees required to estimate the network success through global connectivity. The proposed technique for the assessment of system failure is demonstrated with the help of saturated and unsaturated distribution networks.

Important Links:

Go Back