상세 보기
초록
A network consisting of a set ofnodes and a set of links is considered. The nodes are assumed to be perfect and the states of links to be binary and associated to each other. After defining a network structure function, which represents the state of network as a function of the states of links, we obtain some lower and upper bounds on the network reliability by adopting minmax principle and minimal path and cut set arguments. These bounds are given as functions of the reliabilities of links. The bridge network is considered as an example.
키워드
Associate; Minimal path and cut set arguments; Minmax principle; Network reliability; Associate; Minimal path and cut set arguments; Minmax principle; Network reliability