Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Colbourn, C.J.: The combinatorics of network reliability. Oxford University Press, New York (1987)
Shooman, A.M., Kershenbaum, A.: Exact Graph-Reduction Algorithms for Network Reliability Analysis. In: IEEE Global Telecommunications Conference GLOBECOM 1991, pp. 1412–1420. IEEE Press, New York (1991)
Chen, Y., Li, J., Chen, J.: A New Algorithm for Network Probabilistic Connectivity. In: IEEE Military Communications Conference, vol. 2, pp. 920–923. IEEE Press, New York (1999)
Migov, D.A., Rodionova, O.K., Rodionov, A.S., Choo, H.: Network Probabilistic Connectivity: Using Node Cuts. In: Zhou, X., et al. (eds.) EUC Workshops 2006. LNCS, vol. 4097, pp. 702–709. Springer, Heidelberg (2006)
Migov, D.A.: Computing Diameter Constrained Reliability of a Network with Junction Points. Automation and Remote Control 72(7), 1415–1419 (2011)
Won, J.-M., Karray, F.: Cumulative Update of All-Terminal Reliability for Faster Feasibility Decision. IEEE Trans. on Reliability 59(3), 551–562 (2010)
Rodionov, A.S., Migov, D.A., Rodionova, O.K.: Improvements in the Efficiency of Cumulative Updating of All-Terminal Network Reliability. IEEE Trans. on Reliability 61(2), 460–465 (2012)
Khadiri, M.E., Marie, R., Rubino, G.: Parallel Estimation of 2-Terminal Network Reliability by a Crude Monte Carlo Technique. In: Sixth International Symposium on Computer and Information Sciences, pp. 559–570. Elsevier (1991)
Martínez, S.P., Calvino, B.O., Rocco, S.C.M.: All-Terminal Reliability Evaluation through a Monte Carlo Simulation Based on an MPI Implementation. In: European Safety and Reliability Conference: Advances in Safety, Reliability and Risk Management (PSAM 2011/ESREL 2012), Helsinki, pp. 1–6 (2012)
Sun, F., Shayman, M.A.: On Pairwise Connectivity of Wireless Multihop Networks. Int. J.Secur. Netw. 2(1/2), 37–49 (2007)
Potapov, A., Goemann, B., Wingender, E.: The Pairwise Disconnectivity Index as a New Metric for the Topological Analysis of Regulatory Networks. BMC Bioinformatics 9(1), 1–15 (2008)
Rodionov, A.S., Rodionova, O.K., Choo, H.: On the Expected Value of a Number of Disconnected Pairs of Nodes in Unreliable Network. In: Gervasi, O., Gavrilova, M.L. (eds.) ICCSA 2007, Part III. LNCS, vol. 4707, pp. 534–543. Springer, Heidelberg (2007)
Page, L.B., Perry, J.E.: A Practical Implementation of the Factoring Theorem for Network Reliability. IEEE Trans. on Reliability 37(3), 259–267 (1998)
Rodionova, O.K., Rodionov, A.S., Choo, H.: Network Probabilistic Connectivity: Exact Calculation with Use of Chains. In: Bubak, M., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2004. LNCS, vol. 3036, pp. 565–568. Springer, Heidelberg (2004)
Migov, D.A.: Formulas for Fast Calculating a Reliability of Graphs with Small Dimension. Problems of Informatics 2(6), 10–17 (2010) (in Russian)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Migov, D.A., Rodionov, A.S. (2014). Parallel Implementation of the Factoring Method for Network Reliability Calculation. In: Murgante, B., et al. Computational Science and Its Applications – ICCSA 2014. ICCSA 2014. Lecture Notes in Computer Science, vol 8584. Springer, Cham. https://doi.org/10.1007/978-3-319-09153-2_49
Download citation
DOI: https://doi.org/10.1007/978-3-319-09153-2_49
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09152-5
Online ISBN: 978-3-319-09153-2
eBook Packages: Computer ScienceComputer Science (R0)