Abstract
The problems of optimizing the network structure by the reliability criteria is discussed. The networks with absolutely reliable nodes and unreliable edges are considered, and a special attention is given to the structures based on rings. The tasks of global optimization, optimal interconnection, and optimal addition of new edges to existent graphs are considered and reliability polynomials are used for optimization. Some derivations are made with the use of original methods based on consideration of long chains.
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.
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
Koide, T., Shinmori, S., Ishii, H.: Topological optimization with a network reliability constraint. Discrete Appl. Math. 115(1-3), 135–149 (2001)
Shao, F.-M., Zhao, L.-C.: Optimal Design Improving a Communication Network Reliability. Microelectronics & Reliability 37(0), 591–595 (1997)
Carlier, J., Yu, L., Lutton, J.-L.: Reliability Evaluation of Large Telecommunication Networks. Discrete Appl. Math. 76(1-3), 61–80 (1997)
Fard, N., Lee, T.-H.: Spanning Tree Approach in All-Terminal Network Reliability Expansion. Computer Comm. 24(13), 1348–1353 (2001)
Levendovszky, J., Jereb, L., Elek, Z., Vesztergombi, G.: Adaptive Statistical Algorithms in Network Reliability Analysis. Performance Evaluation 48(1-4), 225–226 (2000)
Shooman, A.M.: Algorithms for network reliability and connection availability analysis. In: Electro/1995 Int. Professional Erogram Proc., pp. 309–333 (1997)
Liu, B., Iwamura, K.: Topological Optimization Models for Communication Network with Multiple Reliability Goals. Computers & Math. with Appl. 39(7-8), 59–59 (2000)
Jan, R.-H.: Design of Reliable Networks. Computers Ops. Res. 20(1), 25–34 (1993)
Rodionova, O.K.: Application Package GRAPH-ES/3. Connectivity of the Multigraphs with Unreliable Edges (Atlas, procedures). Preprint n. 356, Computing Center of the SB AS of the USSR, Novosibirsk (1982) (in Russian)
Rodionova, O.K., Gertzeva, A.A.: On the Construction of the Optimal-connected graphs. In: Proc. of the ICS-NET 2001 Int. Workshop, Moscow, pp. 200–208 (2001) (in Russian)
Ayanoglu, E., Cpih-Lin: A Method of Computing the Coefficients of the Network Reliability Polynomial. In: GLOBECOM 1989, IEEE, vol. 1, pp. 331–337 (1989)
Mainagashev, S.M., Netchepurenko, M.I.: On Uniformity of Optimally Connected Multi-Graphs. System modeling-5, Bull. of the Computing Center SB RAS, Novosibirsk, pp. 19–24 (1979) (in Russian)
Moore, E.F., Shannon, C.E.: Reliable Circuits Using Less Reliable Relays. J. Franclin Inst. 262(4b), 191–208 (1956)
Rodionova, O.K.: Some Methods for Speed up the Calculation of Information Networks Reliability. In: Proc. XXX Int. Conf. “IT in Science, Education, Telecommunications and Business, Ukraine, Gurzuf, pp. 215–217 (2003)
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: Optimal Structures. 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 3046. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24768-5_46
Download citation
DOI: https://doi.org/10.1007/978-3-540-24768-5_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22060-2
Online ISBN: 978-3-540-24768-5
eBook Packages: Springer Book Archive