Abstract
The task of calculating the expectation of a number of disconnected pairs of nodes (EDP) in unreliable network is discussed. The task is NP-hard, that is it requires exhaustive search of subgraphs. The techniques for decreasing a number of enumerated subgraphs by using the branching (factoring) method and taking advantage from possible structural features are discussed. Usage of chains for reduction of the task dimension is considered.
This research was supported by the MIC(Ministry of Information and Communication), Korea, under the ITRC(Information Technology Research Center) support program supervised by the IITA(Institute of Information Technology Assessment), IITA-2006-(C1090-0603-0046), and grant CS-9505.2006.9 of President of Russian Federation. Corresponding author: H. Choo.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Rodionova, O.K., Rodionov, A.S., Choo, H.: Network Probabilistic Connectivity: Exact Calculation with Use of Chains. In: Laganà, A., Gavrilova, M., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds.) ICCSA 2004. LNCS, vol. 3046, pp. 315–324. Springer, Heidelberg (2004)
Krivoulets, V.G., Polesskii, V.P: What is the Theory of Bounds for Network Reliability? Inf. Processes 1(2), 199–203 (2001)
Cancela, H., Petingi, L.: Diameter constrained network reliability: exact evaluation by factorization and bounds. In: Proc. of the Int. Conf. on Industrial Logistics, Japan, pp. 359–366 (2001)
Lucet, C., Manouvrier, J.-F.: Exact Methods to compute Network Reliability. In: Proc. of 1st International Conf. on Mathematical Methods in Reliability, Bucharest, Roumanie (September 1997), paper available via http://ramp.ucsd.edu/resources.html
Satyanarayana, A., Chang, M.K.: Network reliability and the factoring theorem. Networks 13, 107–120 (1983)
Shooman, A.M.: Algorithms for Network Reliability and Connection Availability Analysis. In: Electro/95 Int. Professional Program Proc., pp. 309–333 (1995)
Palmer, C.R., Siganos, G., Faloutsos, M., Faloutsos, C., Gibbons, P.: The connectivity and faulttolerance of the Internet topology. Workshop on Network-Related Data Management (NRDM-2001), paper available via http://www.research.att.com/~divesh/papers/cjfgs98-ir.ps
Rodionov, A., Rodionova, O.: Network Probabilistic Connectivity: Expectation of a Number of Disconnected Pairs of Nodes. In: Gerndt, M., Kranzlmüller, D. (eds.) HPCC 2006. LNCS, vol. 4208, pp. 101–109. Springer, Heidelberg (2006)
Shooman, A.M., Kershenbaum, A.: Exact Graph-Reduction Algorithms for Network Reliability Analysis. In: Proc. GLOBECOM’ 91. vol. 2, pp. 1412–1420 (1991)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rodionov, A.S., Rodionova, O.K., Choo, H. (2007). On the Expected Value of a Number of Disconnected Pairs of Nodes in Unreliable Network. In: Gervasi, O., Gavrilova, M.L. (eds) Computational Science and Its Applications – ICCSA 2007. ICCSA 2007. Lecture Notes in Computer Science, vol 4707. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74484-9_46
Download citation
DOI: https://doi.org/10.1007/978-3-540-74484-9_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74482-5
Online ISBN: 978-3-540-74484-9
eBook Packages: Computer ScienceComputer Science (R0)