Towards Scalable k-out-of-n Models for Assessing the Reliability of Large-Scale Function-as-a-Service Systems with Bayesian Networks

Bibartiu, Otto; Dürr, Frank; Rothermel, Kurt; Ottenwalder, Beat; Grau, Andreas

doi:10.1109/cloud.2019.00095

Cited by 1 publication

(1 citation statement)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To use the k/n voting gate in settings as they occur in current large-scale systems, where we have large sets of redundant server clusters, we provide a scalable BN representation of the k/n voting gate. This work is based on our previous work [27], where we showed that the scalable k/n model can be built with the temporal noisy adder by Heckerman [24]. The BN model of the noisy adder is a random variable representing a counter and a probability distribution that defines the likelihood of observing a certain count.…”

Section: Introductionmentioning

confidence: 99%

Scalable k-out-of-n models for dependability analysis with Bayesian networks

Bibartiu

Dürr

Rothermel

et al. 2021

Reliability Engineering & System Safety

Self Cite

View full text Add to dashboard Cite

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.We propose a scalable k/n voting gate representation for BNs, based on the temporal noisy adder. The resulting model reduces the initial exponential to polynomial memory growth without a custom inference algorithm. Previous BN implementations of the k/n voting gate could only handle around 30 input events until memory limits make inference infeasible. However, our evaluation shows that our scalable model can handle more than 700 input events per gate, making it possible to evaluate large scale systems.

show abstract

Section: Introductionmentioning

confidence: 99%