Skip to main content
Article thumbnail
Location of Repository

An efficient algorithm for reliability lower bound of distributed systems

By Mohamed H. S. Mohamed, Yang Xiao-zong, Liu Hong-wei and Wu Zhi-bo

Abstract

Abstract—The reliability of distributed systems and computer networks have been modeled by a probabilistic network or a graph G. Computing the residual connectedness reliability (RCR), denoted by R(G), under the node fault model is very useful, but is an NP−hard problem. Since it may need exponential time of the network size to compute the exact value of R(G), it is important to calculate its tight approximate value, especially its lower bound, at a moderate calculation time. In this paper, we propose an efficient algorithm for reliability lower bound of distributed systems with unreliable nodes. We also applied our algorithm to several typical classes of networks to evaluate the lower bounds and show the effectiveness of our algorithm. Keywords—Distributed systems, probabilistic network, residual connectedness reliability, lower bound. I

Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.193.4694
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.waset.org/journals/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.