In this study a class of new methods to evaluate bounds of the reliability polynomial coefficients is proposed. These new methods enumerate progressively simple paths or p-acyclic subgraphs finding for each new term a closer lower bound. The process, for high complex networks, can be interrupted, obtaining in this case only approximate values, while the final exact results can be obtained for computationally tractable networks. Alternatively, the a priori knowledge of all simple paths allows us to find a succession of upper and lower bounds still convergent to the exact values of coefficients. Finally, a comparison is done between the results obtained in this paper and those already presented in the literature.

Bounds evaluation of coefficients in the reliability polynomial

Pietro Camarda
1990

Abstract

In this study a class of new methods to evaluate bounds of the reliability polynomial coefficients is proposed. These new methods enumerate progressively simple paths or p-acyclic subgraphs finding for each new term a closer lower bound. The process, for high complex networks, can be interrupted, obtaining in this case only approximate values, while the final exact results can be obtained for computationally tractable networks. Alternatively, the a priori knowledge of all simple paths allows us to find a succession of upper and lower bounds still convergent to the exact values of coefficients. Finally, a comparison is done between the results obtained in this paper and those already presented in the literature.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11589/8423
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • Scopus 7
  • ???jsp.display-item.citation.isi??? 5
social impact