%0 Journal Article
	%A Mohamed H. S. Mohamed and  Yang Xiao-zong and  Liu Hong-wei and  Wu Zhi-bo
	%D 2009
	%J International Journal of Computer and Information Engineering
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 27, 2009
	%T An Efficient Algorithm for Reliability Lower Bound of Distributed Systems
	%U https://publications.waset.org/pdf/3210
	%V 27
	%X 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.
	%P 502 - 504