|
| << vorige | volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 16 van 127 gevonden artikelen
| Titel: |
An Efficient Algorithm for Reliability Upper Bound of Distributed Systems with Unreliable Nodes |
| Auteur: |
Mohamed H. S. Mohamed, Yang Xiaozong Liu Hongwei Wu Zhibo |
| Verschenen in: |
International journal on computer science and engineering |
| Paginering: | Jaargang 2 (2010) nr. 2 pagina's 305-308 |
| Jaar: |
2010 |
| Inhoud: |
The reliability of distributed systems in which the communication links are considered reliable while the computing nodes may fail with certain probabilities have been modeled by a probabilistic network or a graph G. Computing the residual connectedness reliability (RCR), denoted by R(G), of probabilistic networks with unreliable nodes is very useful, but is an NP-hard problem. To derive the exact R(G) expressions for large networks can become rather complex. As network size increases, the reliability bounds could be used to estimate the reliability of the networks. In this paper, we present an efficient algorithm for computing the reliability upper bound of distributed systems with unreliable nodes. We also apply our algorithm to sometypical classes of graphs in order to evaluate the upper bound and show the effectiveness and the efficiency of the new algorithm. Numerical results are presented. |
| Uitgever: |
Engg Journals Publications (provided by DOAJ) |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 16 van 127 gevonden artikelen
| << vorige | volgende >> |