The Reliability Analysis of Distributed Computing Systems with Imperfect Nodes

Abstract

The reliability of a distributed computing system depends on the reliability of its communication links and nodes and on the distribution of its resources, such as programs and data files. Many algorithms have been proposed for computing the reliability of distributed computing systems, but they have been applied mostly to distributed computing systems with perfect nodes. However, in real problems, nodes as well as links may fail. This paper proposes two new algorithms for computing the reliability of a distributed computing system with imperfect nodes. Algorithm I is based on a symbolic approach that includes two passes of computation. Algorithm II employs a general factoring technique on both nodes and edges. Comparisons with existing methods show the usefulness of the proposed algorithms for computing the reliability of large distributed computing systems.

Monte Carlo simulation-based algorithms for estimating the reliability of mobile agent-based systems

“…In this paper, we focus on estimating PrðS is operationaljXÞ. The above definition can be extended to take into account the reliability of nodes (or vertices) (Lin et al, 1999;Netes and Filin, 1996). Hence, Eq.…”

Reliability Evaluation of Distributed Computer Systems Subject to Imperfect Coverage and Dependent Common-Cause Failures

“…An FST is an MFST if there exists no other FST that is a subset of it. An MFST is said to be operational when all its components are operational [7,19] . The approach developed in this study is also applicable to evaluate distributed system reliability (DSR), which is defined as the probability that at least one MFST for all programs is operational [7] .…”

A Real-Time Performance Evaluation Model for Distributed Software with Reliability Constrains

“…Symbolic Method (SM) and Factoring Method (FM) algorithms were proposed to compute the reliability of a distributed computing system with imperfect nodes [10]. FM algorithm first selects a working set of nodes, then applies the factoring technique used in [15] to compute reliability for every sub-graph G jH .…”

“…Many methods are developed for evaluation purpose. For reliability evaluation, researchers often design some algorithms to simplify Markov models, generate corresponding File Spanning Tree (FST) to evaluate the K-terminal reliability factoring theorems [2,7,9,10] or the graph theories and probability synthetically. In [8], an algorithm is proposed which employs a different concept that requires one step to give the reliability expression.…”