Network Reliability pp 71-80 | Cite as
Lomonosov’s Turnip
- 194 Downloads
Abstract
Lomonosov’s turnip is a very powerful Monte Carlo algorithm for estimating Network reliability. It was invented by M.V. Lomonosov in 1986 and first described in [1]. This algorithm is applicable to finding the probability of network terminal (or all-node) connectivity probability for the case of arbitrary values of edge (or node) failure probabilities. An outstanding feature of this algorithm is that it enables obtaining estimates with high accuracy for very small network failure probabilities known as “rare event situation”. The name “turnip” comes from a diagram reminding a turnip which describes so-called evolution process which is central to the main idea of the algorithm.
Keywords
Evolution process Turnip diagram Closure Edge and node failureReferences
- 1.Lomonosov, M. (1994). On Monte Carlo estimates in network reliability. Probability in the Engineering and Informational Sciences, 8, 245–264.CrossRefGoogle Scholar
- 2.Elperin, T., Gertsbakh, I. B., & Lomonosov, M. (1991). Estimation of network reliability using graph evolution models. IEEE Transactions on Reliability, 40(5), 572–581.CrossRefGoogle Scholar
- 3.Gertsbakh, I., & Shpungin, Y. (2009). Models of network reliability: Analysis, combinatorics and Monte Carlo. Boca Raton: CRC Press.zbMATHGoogle Scholar
- 4.Lomonosov, M., & Shpungin, Y. (1999). Combinatorics and reliability Monte Carlo. Random Structures and Algorithms, 14, 329–343.MathSciNetCrossRefGoogle Scholar
- 5.Gertsbakh, I., & Shpungin, Y. (2011). Network reliability and resilience. New York: Springer.Google Scholar
- 6.Gertsbakh, I., Shpungin, Y., & Vaisman, R. (2014). Network reliability Monte Carlo with nodes subject to failure. International Journal of Performability Engineering, 10(2), 161–170.zbMATHGoogle Scholar
- 7.Kroese, D., Taimre, T., & Botev, Z. I. (2011). Handbook of Monte Carlo methods. New York: Wiley.Google Scholar