Advertisement

On the Expected Value of a Number of Disconnected Pairs of Nodes in Unreliable Network

  • Alexey S. Rodionov
  • Olga K. Rodionova
  • Hyunseung Choo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4707)

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.

Keywords

Random Graph Exhaustive Search Network Reliability Dangling Node Task Dimension 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)Google Scholar
  2. 2.
    Krivoulets, V.G., Polesskii, V.P: What is the Theory of Bounds for Network Reliability? Inf. Processes 1(2), 199–203 (2001)Google Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    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
  5. 5.
    Satyanarayana, A., Chang, M.K.: Network reliability and the factoring theorem. Networks 13, 107–120 (1983)zbMATHCrossRefGoogle Scholar
  6. 6.
    Shooman, A.M.: Algorithms for Network Reliability and Connection Availability Analysis. In: Electro/95 Int. Professional Program Proc., pp. 309–333 (1995)Google Scholar
  7. 7.
    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
  8. 8.
    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)CrossRefGoogle Scholar
  9. 9.
    Shooman, A.M., Kershenbaum, A.: Exact Graph-Reduction Algorithms for Network Reliability Analysis. In: Proc. GLOBECOM’ 91. vol. 2, pp. 1412–1420 (1991)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Alexey S. Rodionov
    • 1
  • Olga K. Rodionova
    • 2
  • Hyunseung Choo
    • 3
  1. 1.Institute of Computational Mathematics and Mathematical Geophysics, SB RAS, NovosibirskRussia
  2. 2.Siberian State University of Telecommunications and Informatics, NovosibirskRussia
  3. 3.School of Information and Communication Engineering, Sungkyunkwan University, 440-746, SuwonKorea

Personalised recommendations