A simulation of network reliability design algorithm by using the state decomposition method

摘要

On estimation of a 2-terminal network reliability, the so called state decomposition method generates a binary computation tree and a set of all paths between the 2-terminals. In this paper, an algorithm for generating an optimal binary computation tree is presented with a prototype utilizing the set of all paths given by the state decomposition method. Because the developed prototype constructs optionally either an optimal or a quasi-optimal tree for computing the network availability, this provides an useful tool for reliability design which needs repetitive computation of network availability. By using an optimal or a quasi-optimal tree, we can analyze an optimization algorithm for the cost effective design of communication network. This algorithm maximizes the network availability between given pair nodes subject to the given upper limit of construction costs and/or maintenance costs.