Scalable k-out-of-n models for dependability analysis with Bayesian networks
Otto Bibartiu,
Dürr, Frank,
Kurt Rothermel,
Ottenwälder, Beate and
Andreas Grau
Reliability Engineering and System Safety, 2021, vol. 210, issue C
Abstract:
Availability analysis is indispensable in evaluating the dependability of safety and business-critical systems, for which fault tree analysis (FTA) has proven very useful throughout research and industry. Fault trees (FT) can be analyzed by means of a rich set of mathematical models. One particular model are Bayesian networks (BNs) which have gained considerable popularity recently due to their powerful inference abilities. However, large-scale systems, as found in modern data centers for cloud computing, pose modeling challenges that require scalable availability models. An equivalent BN of a FT has no scalable representation for the k-out-of-n (k/n) voting gate because the conditional probability table that constitutes the k/n voting gate grows exponentially in n. Thus, the memory becomes the limiting factor.
Keywords: Availability; Scalability; Voting Gate; Fault-Tree; Bayesian networks (search for similar items in EconPapers)
Date: 2021
References: Add references at CitEc
Citations: View citations in EconPapers (6)
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0951832021000910
Full text for ScienceDirect subscribers only
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:eee:reensy:v:210:y:2021:i:c:s0951832021000910
DOI: 10.1016/j.ress.2021.107533
Access Statistics for this article
Reliability Engineering and System Safety is currently edited by Carlos Guedes Soares
More articles in Reliability Engineering and System Safety from Elsevier
Bibliographic data for series maintained by Catherine Liu (repec@elsevier.com).