Network Probabilistic Connectivity: Using Node Cuts
The new algorithmic technique which allow higher efficiency in the precise calculation of the reliability of an undirected graph with absolutely reliable nodes and unreliable edges is considered in this paper. As graph’s reliability we mean its probabilistic connectivity. The proposed technique is based on the reduction of the dimension of a calculated graph by considering its node’s cuts. Comprehensive computer simulation results show the advantages of the proposed algorithms, that the calculation time decreases significantly in comparison with existent methods.
KeywordsTopological Optimization Simple Event Network Reliability Probabilistic Connectivity Simple Chain
- 3.Shooman, A.M., Kershenbaum, A.: Exact Graph-Reduction Algorithms for Network Reliability Analysis. In: Proc. GLOBECOM 1991, vol. 2, pp. 1412–1420 (1991)Google Scholar
- 4.Shooman, A.M.: Algorithms for Network Reliability and Connection Availability Analysis. Electro/95 Int. Professional Program Proc. 309–333 (1995)Google Scholar
- 5.Rodionov, A.S., Choo, H.: On Generating Random Network Structures: Connected Graphs. In: Proceedings of the International Conference on Information Networking ICOIN 2004, vol. III, pp. 1145–1152 (2004)Google Scholar