Abstract
Methods for network reliability and reliability polynomials computation are presented. Networks with absolutely reliable edges and unreliable nodes are considered. Tasks for reliability computation using such quality of service criteria as ability to transmit given data stream with time restrictions and without them are considered and corresponding algorithms are developed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Shooman, A.M.: Algorithms for Network Reliability and Connection Availability Analysis. In: Electro/1995 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. In: Workshop on Network-Related Data Management, NRDM-2001 (2001), http://www.research.att.com/~divesh/papers/cjfgs98-ir.ps
Rodionova, O.K., Rodionov, A.S., Choo, H.: 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.) ICCSA 2004. LNCS, vol. 3046, pp. 315–324. Springer, Heidelberg (2004)
Ayanoglu, E., Cpih-Lin: A Method of Computing the Coefficients of the Network Reliability Polynomial. In: GLOBECOM 1989, vol. 1, pp. 331–337. IEEE, Los Alamitos (1989)
Page, L.B., Perry, J.E.: Reliability Polynomials and Link Importance in Networks. IEEE Transactions on Reliability 43(1), 51–58 (1994)
Kelmans, A.K.: Crossing Properties of Graph Reliability Functions. Journal of Graph Theory 35(9), 206–221 (2000)
Colbourn, C.J., Harms, D.D., Myrvold, W.J.: Reliability Polynomials can Cross Twice. Journal of the Franklin Institute 300(3), 627–633 (1993)
Camarda, P.: Bounds Evaluation of Coefficients in the Reliability Polynomial. Microelectronics and Reliability 30(2), 1110–1699 (1990)
Rodionova, O.K., Rodionov, A.S., Choo, H.: Network Probabilistic Connectivity: Reliability Polynomial. In: ISPC Communication-2004. Proc. Of the 8th Int. Conf. Problems of Operation of Information Networks, vol. 1, pp. 321–327 (2004)
Murzin, M.Y.: Calculation of the reliability polynomial coefficients for an undirected graph. In: Proceedings of Young Scientists Conference, Institute of Computational Mathematics and Mathematical Geophysics, Novosibirsk, pp. 141–147 (2004) (in Russian)
Moore, E.F., Shannon, C.E.: Reliable Circuits Using Less Reliable Relays. J. Franclin Inst. 262(4b), 191–208 (1956)
Murzin, M.Y.: Computation of reliability and reliability polynomial coefficients for telecommunication networks with reliable links and unreliable nodes. In: 8th International Conference Problems of Operation of Information Networks, vol. 2, pp. 213–216 (2004) (in Russian)
Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton Pres, Princeton (1962)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Murzin, M.Y., Rodionov, A.S. (2006). Branching Method for Computation of Probability of Given Data Stream Transmission. In: Gavrilova, M., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3980. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751540_64
Download citation
DOI: https://doi.org/10.1007/11751540_64
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34070-6
Online ISBN: 978-3-540-34071-3
eBook Packages: Computer ScienceComputer Science (R0)