We consider the problem of a network reliability calculation for a network with unreliable communication links and perfectly reliable nodes. For such networks, we study two different reliability indices: network probabilistic connectivity and its average pairwise connectivity. The problem of precise calculation of both these characteristics is known to be NP-hard. For solving these problems, we propose the parallel methods, which are based on the well-known factoring method. Some optimization techniques for proposed algorithms are proposed for speeding up calculations taking into account a computer architecture. © 2014 Springer International Publishing.
CITATION STYLE
Migov, D. A., & Rodionov, A. S. (2014). Parallel implementation of the factoring method for network reliability calculation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8584 LNCS, pp. 654–664). Springer Verlag. https://doi.org/10.1007/978-3-319-09153-2_49
Mendeley helps you to discover research relevant for your work.