Abstract
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.
This paper was partially supported by BK21 program, University ITRC and RFBR. Dr. Choo is the corresponding author.
This is a preview of subscription content, log in via an institution to check access.
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
Moore, E.F., Shannon, C.E.: Reliable Circuits Using Less Reliable Relays. J. Franclin Inst. 262(4b), 191–208 (1956)
Shooman, A.M., Kershenbaum, A.: Exact Graph-Reduction Algorithms for Network Reliability Analysis. In: Proc. GLOBECOM 1991, vol. 2, pp. 1412–1420 (1991)
Shooman, A.M.: Algorithms for Network Reliability and Connection Availability Analysis. In: Electro/1995 Int. Professional Program Proc., pp. 309–333 (1995)
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)
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)
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)
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)
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)
Tolchan, A.Y.: On the Network Connectivity. Problems of the information transmission 17, 3–7 (1964) (in Russian)
Koide, T., Shinmori, S., Ishii, H.: Topological optimization with a network reliability constraint. Discrete Appl. Math. 115(1-3), 135–149 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rodionova, O.K., Rodionov, A.S., Choo, H. (2004). Network Probabilistic Connectivity: Exact Calculation with Use of Chains. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds) Computational Science and Its Applications – ICCSA 2004. ICCSA 2004. Lecture Notes in Computer Science, vol 3045. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24767-8_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-24767-8_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22057-2
Online ISBN: 978-3-540-24767-8
eBook Packages: Springer Book Archive