Fault Trees for Networks, Where Only One Node is Allowed to be Disconnected from the Rest
This report concerns the quantification of the fault tolerance of (n - l)-out-of-n:G computer networks. More precisely: At least n - l of the networks'n nodes need to be intact and connected for mission success. (Since nodes as well as data links may become faulty, the usual simplistic combinatorial approach with ideally dependable links does not apply.) The fault tree construction process is bottom up through 3 levels: i) point-to-point connectivity, ii) k-terminal connectivity, iii) "logical" combination of the connectivity of several clusters, e.g. such for high-level tasks of parallel computing. lt is shown how fault trees can be evaluated in order to yield not only unavailability, but also MTTF and MTTR.
Nutzung und Vervielfältigung:
Alle Rechte vorbehalten