Title :
A novel approach to determine minimal tie-sets of complex network
Author :
Fotuhi-Firuzabad, M. ; Billinton, R. ; Munian, T.S. ; Vinayagam, B.
Author_Institution :
Dept. of Electr. Eng., Sharif Univ. of Technol., Tehran, Iran
fDate :
3/1/2004 12:00:00 AM
Abstract :
Network reliability analysis is usually based on minimal path or cut enumeration from which the associated reliability expressions are deduced. The cut-set method is a popular approach in the reliability analysis of many systems from simple to complex configurations. The computational requirements necessary to determine the minimal cut-sets of a network depend mainly on the number of minimal paths between the source and the sink. A technique designated as the "Path Tracing Algorithm" is presented in this paper, which can handle both simple and complex networks, and considers both unidirectional and bi-directional branches. A step by step procedure is explained using a bridge-network. The algorithm is easy to program, and does not require limits on the size of the network. The applicability of the proposed technique is illustrated by application to a more complicated system.
Keywords :
matrix algebra; reliability theory; bridge-network; connection matrix; cut-set method; minimal cut-sets; minimal tie-sets; network reliability analysis; path tracing algorithm; Algorithm design and analysis; Bidirectional control; Bridges; Complex networks; Computer networks; Design engineering; Flowcharts; Power systems; Reliability engineering; Systems engineering and theory;
Journal_Title :
Reliability, IEEE Transactions on
DOI :
10.1109/TR.2004.824834