Synthesis of reliable networks in the presence of line failures

This paper is devoted to synthesis of reliable networks when nodes are perfect and links fail independently with the same probability. The All Terminal Reliability (ATR) model is used. When links are highly reliable the solution to the problem is known: it is a class of the so-called super-/spl lambda/ graphs. In this paper we concentrate on networks that are optimal independently on the links' quality: super-/spl lambda/ graphs are searched for a graph that maximizes network reliability when links are very unreliable. We consider the class of regular graphs and show when it can be further limited to circulant ones. Contrary to the approach of other authors, we do not solve the problem analytically but use discrete approximate optimization techniques and obtain a solution, that most probably is very close to the optimal one.

[1]  Frank Harary,et al.  Graph Theory , 2016 .

[2]  Appajosyula Satyanarayana,et al.  A reliability-improving graph transformation with applications to network reliability , 1992, Networks.

[3]  Guifang Wang.  A proof of Boesch's conjecture , 1994, Networks.

[4]  G. Anandalingam,et al.  An integrated system for designing minimum cost survivable telecommunications networks , 1996, IEEE Trans. Syst. Man Cybern. Part A.

[5]  Yash P. Gupta,et al.  Genetic-algorithm-based reliability optimization for computer network expansion , 1995 .

[6]  R. V. Slyke,et al.  On the validity of a reduction of reliable network design to a graph extremal problem , 1987 .

[7]  Ching-Shui Cheng,et al.  Maximizing the total number of spanning trees in a graph: Two related problems in graph theory and optimum design theory , 1981, J. Comb. Theory B.

[8]  Wendy Myrvold,et al.  Uniformly-most reliable networks do not always exist , 1991, Networks.

[9]  Jarosław Arabas,et al.  Designing regular graphs with the use of evolutionary algorithms , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[10]  Yuanping Zhang,et al.  The number of spanning trees in circulant graphs , 2000, Discret. Math..

[11]  Alice E. Smith,et al.  Efficient optimization of all-terminal reliable networks, using an evolutionary approach , 1997 .

[12]  Douglas Bauer,et al.  Combinatorial optimization problems in the analysis and design of probabilistic networks , 1985, Networks.

[13]  Hans-Paul Schwefel,et al.  Evolution and optimum seeking , 1995, Sixth-generation computer technology series.

[14]  Xiaoming Li,et al.  On the existence of uniformly optimally reliable networks , 1991, Networks.

[15]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[16]  S. Jain,et al.  An efficient algorithm for computing global reliability of a network , 1988 .

[17]  F. Boesch,et al.  Super line-connectivity properties of circulant graphs , 1986 .