Branching Method for Computation of Probability of Given Data Stream Transmission

  • Mikhail Y. Murzin
  • Alexey S. Rodionov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3980)


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.


Data Stream Reliability Index Incident Edge 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.
    Shooman, A.M.: Algorithms for Network Reliability and Connection Availability Analysis. In: Electro/1995 Int. Professional Program Proc., pp. 309–333 (1995)Google Scholar
  2. 2.
    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),
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    Page, L.B., Perry, J.E.: Reliability Polynomials and Link Importance in Networks. IEEE Transactions on Reliability 43(1), 51–58 (1994)CrossRefGoogle Scholar
  6. 6.
    Kelmans, A.K.: Crossing Properties of Graph Reliability Functions. Journal of Graph Theory 35(9), 206–221 (2000)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Colbourn, C.J., Harms, D.D., Myrvold, W.J.: Reliability Polynomials can Cross Twice. Journal of the Franklin Institute 300(3), 627–633 (1993)MathSciNetGoogle Scholar
  8. 8.
    Camarda, P.: Bounds Evaluation of Coefficients in the Reliability Polynomial. Microelectronics and Reliability 30(2), 1110–1699 (1990)Google Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    Moore, E.F., Shannon, C.E.: Reliable Circuits Using Less Reliable Relays. J. Franclin Inst. 262(4b), 191–208 (1956)CrossRefMathSciNetGoogle Scholar
  12. 12.
    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)Google Scholar
  13. 13.
    Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton Pres, Princeton (1962)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Mikhail Y. Murzin
    • 1
  • Alexey S. Rodionov
    • 1
  1. 1.Institute of Computational Mathematics and Mathematical GeophysicsSiberian Division of the Russian Academy of ScienceNovosibirskRussia

Personalised recommendations