Network Probabilistic Connectivity: Optimal Structures

Abstract. The problems of optimizing the network structure by the reliability criteria is discussed. The networks with absolutely reliable nodes and unreliable edges are considered, and a special attention is given to the structures based on rings. The tasks of global optimization, optimal interconnection, and optimal addition of new edges to existent graphs are considered and reliability polynomials are used for optimization. Some derivations are made with the use of original methods based on consideration of long chains.

• Type: Conference
• Year: 2004
• Where: ICCSA
• Authors: Olga K. Rodionova, Alexey S. Rodionov, Hyunseung Choo
• Keywords: Applied Computing, ICCSA 2004, Reliability Criteria, Reliable Nodes, Unreliable Edges