Network Probabilistic Connectivity: Exact Calculation with Use of Chains

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


The algorithmic techniques which allow high efficiency in the precise calculation of the reliability of an undirected graph with absolutely reliable nodes and unreliable edges are considered in this paper. The new variant of the branching algorithm that allow branching by chains is presented along with improvement of series-parallel reduction method that permits the reduction of a chain with more than two edges by one step. Some programming techniques which accomplish high efficiency are also discussed. Special notice is given to the problem of computer storage economy. Comprehensive computer simulation results show the advantages of the proposed algorithms, that the calculation time decreases significantly in comparison with existent methods.


Topological Optimization Random Graph Exact Calculation Network Reliability Dangling Node 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Moore, E.F., Shannon, C.E.: Reliable Circuits Using Less Reliable Relays. J. Franclin Inst. 262(4b), 191–208 (1956)CrossRefMathSciNetGoogle Scholar
  2. 2.
    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
  3. 3.
    Shooman, A.M.: Algorithms for Network Reliability and Connection Availability Analysis. In: Electro/1995 Int. Professional Program Proc., pp. 309–333 (1995)Google Scholar
  4. 4.
    Rodionov, A.S., Rodionova, O.K.: On a Problem of Practical Usage of the Moore- Shennon Formula for Calculating the Reliability of Local Networks. In: Proc. 2nd Int. Workshop INFORADIO 2000, Omsk, pp. 67–69 (2000)Google Scholar
  5. 5.
    Rodionova, O.K.: Some Methods for Speed up the Calculation of Information Networks Reliability. In: Proc. XXX International Conf. “IT in Science, Education, Telecommunications and Business”, Ukraine, Gurzuf, pp. 215–217 (2003)Google Scholar
  6. 6.
    Chen, Y., Li, J., Chen, J.: A new Algorithm for Network Probabilistic Connectivity. In: Proc. MILCOM 1999, vol. 2, pp. 920–923. IEEE, Los Alamitos (1999)Google Scholar
  7. 7.
    Rodionova, O.K.: Application Package GRAPH-ES/3. Connectivity of the Multigraphs with Unreliable Edges (Atlas, procedures). Preprint No. 356, Computing Center of the SB AS of the USSR, Novosibirsk (1982) (in Russian)Google Scholar
  8. 8.
    Rodionova, O.K., Gertzeva, A.A.: On the Construction of thr Optimal-connected graphs. In: Proc. of the ICS-NET 2001 Int. Workshop, Moscow, pp. 200–204 (2001) (in Russian)Google Scholar
  9. 9.
    Tolchan, A.Y.: On the Network Connectivity. Problems of the information transmission 17, 3–7 (1964) (in Russian)zbMATHGoogle Scholar
  10. 10.
    Koide, T., Shinmori, S., Ishii, H.: Topological optimization with a network reliability constraint. Discrete Appl. Math. 115(1-3), 135–149 (2001)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Olga K. Rodionova
    • 1
  • Alexey S. Rodionov
    • 1
  • Hyunseung Choo
    • 2
  1. 1.Institute of Computational Mathematics and Mathematical GeophysicsSiberian Division of the Russian Academy of ScienceNovosibirskRUSSIA
  2. 2.School of Information and Communication EngineeringSungkyunkwan UniversitySuwonKOREA

Personalised recommendations