Premium
Reliability analysis of replicated and–or graphs
Author(s) -
Liang DeRon,
Jan RongHong,
Tripathi Satish K.
Publication year - 1997
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/(sici)1097-0037(199707)29:4<195::aid-net2>3.0.co;2-a
Subject(s) - computer science , time complexity , vertex (graph theory) , computation , reliability (semiconductor) , graph , combinatorics , algorithm , discrete mathematics , theoretical computer science , mathematics , power (physics) , physics , quantum mechanics
A computation task running in distributed systems can be represented as a directed graph H ( V , E ) whose vertices and edges may fail with known probabilities. In this paper, we introduce a reliability measure, called the distributed task reliability, to model the reliability of such computation tasks. The distributed task reliability is defined as the probability that the task can be successfully executed. Due to the and‐fork/and‐join constraint, the traditional network reliability problem is a special case of the distributed task reliability problem, where the former is known to be NP ‐hard in general graphs. For two‐terminal and–or series‐parallel (AOSP) graphs, the distributed task reliability can be computed in polynomial time. We consider a graph H k ( Vˆ , Eˆ ), named a k‐replicated and–or series‐parallel (RAOSP) graph, which is obtained from an AOSP graph H ( V , E ) by adding ( k ‐ 1) replications to each vertex and adding proper edges between two vertices. It can be shown that the RAOSP graphs are not AOSP graphs; thus, the existing polynomial algorithm does not apply. Previously, only exponential time algorithms as used in general graphs are known for computing the reliability of H k ( Vˆ , Eˆ ). In this paper, we present a linear time algorithm with O ( K (| V | + | E |)) complexity to evaluate the reliability of the graph H k ( Vˆ , Eˆ ), where K = max{ k 2 2 2k , 2 3 k }. © 1997 John Wiley & Sons, Inc.