Synthesis of reliable networks in the presence of line failures
B Sawionek , J. Wojciechowski , Jarosław Arabas
AbstractThis 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- lambda; graphs. In this paper we concentrate on networks that are optimal independently on the links' quality: super- 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
|Book||The 2000 IEEE International Symposium on Circuits and Systems, 2000. Proceedings. ISCAS 2000 Geneva, vol. 4, 2000|
|Keywords in English||all terminal reliability model, circulant graphs, discrete approximate optimization techniques, graphs, graph theory, Intelligent networks, line failures, network reliability, network synthesis, optimisation, optimization methods, probability, regular graphs, reliability theory, reliable network synthesis, super- lambda, telecommunication network reliability, Terminology|
|Publication indicators||= 0; = 10.0; = 10|
|Citation count*||10 (2020-09-28)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.