Comparison analysis of reliability of networks with identical edges |

G. Sh. Tsitsiashvili |

2010, issue 2, Ñ. 192–198 |

Abstract |

Efficient and fast algorithms of a calculation of parameters in the asymptotic Burtin – Pittel formula for networks with identical and high reliable edges are constructed. These algorithms are applied to a comparison of networks constructed from a radial-circle network by a canceling of some edges or their collapsing into nodes or by edges separate reservation. |

a radial-circle network, a separate reservation, the Burtin – Pittel formulaKeywords: |

Download the article (PDF-file) |

## References |

[1] R. E. Barlow, F. Proschan, Mathematical Theory of Reliability, Wiley, London and New York, 1965. [2] I.A. Ushakov i dr., Nadezhnost' texnicheskix sistem, Spravochnik, Radio i svyaz', M., 1985. [3] I. Gertsbukh, Reliability Theory With Applications to Preventive Maintenance, Springer Verlag, 2000. [4] L. R. Ford, D. R. Fulkerson, Flows in networks, Princeton university press, Princeton, New Jersey, 1962. [5] V. K. Popkov, Matematicheskie modeli svyaznosti, Izd-vo IVM i MG SO RAN, Novosibirsk, 2006. [6] T. Kormen, Ch. Lejzerson, R. Rivest, Algoritmy: postroenie i analiz, Laboratoriya bazovyx znanij, Moskva, 2004. [7] G. Sh. Tsitsiashvili, “Asymptotic analysis of lattice reliability”, Reliability: Theory and Applications, 2010, no. 1, 65–70. [8] G. Sh. Tsitsiashvili, A. S. Losev, “Calculation of connectivity probability in recursively defined random networks”, Reliability: Theory and Applications, 2010, no. 1, 40–46. |