Topological optimization of computer network expansion with reliability constraint

This paper considers an optimization of a computer network expansion with a reliability constraint. Computer network expansion is achieved by adding a new node and communication links to a computer network such that reliability of the computer network is not less than a given level. In order to speed up the procedure of solution, an upper bound on system reliability in terms of node degrees is applied. The main problem is split into several small problems, the small problem is decomposed subproblems and the subproblems are solved effectively by a new method, forest search algorithm.