On the robustness of fishman's bound-based method for the network reliability problem

Abstract : Static network unreliability computation is an NP-hard problem, leading to the use of Monte Carlo techniques to estimate it. The latter, in turn, suffer from the rare event problem, in the frequent situation where the system's unreliability is a very small value. As a consequence, specific rare event event simulation techniques are relevant tools to provide this estimation. We focus here on a method proposed by Fishman making use of bounds on the structure function of the model. The bounds are based on the computation of (disjoint) mincuts disconnecting the set of nodes and (disjoint) minpaths ensuring that they are connected. We analyze the robustness of the method when the unreliability of links goes to zero. We show that the conditions provided by Fishman, based on a bound, are only sufficient, and we provide more insight and examples on the behavior of the method.
Type de document :
Communication dans un congrès
Winter Simulation Conference, Dec 2015, Huntington Beach, United States
Liste complète des métadonnées

Littérature citée [18 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01239546
Contributeur : Bruno Tuffin <>
Soumis le : lundi 7 décembre 2015 - 22:11:41
Dernière modification le : vendredi 25 mai 2018 - 11:44:02
Document(s) archivé(s) le : samedi 29 avril 2017 - 09:21:41

Fichier

FishmanV3.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01239546, version 1

Citation

Héctor Cancela, Mohamed El Khadiri, Gerardo Rubino, Bruno Tuffin. On the robustness of fishman's bound-based method for the network reliability problem. Winter Simulation Conference, Dec 2015, Huntington Beach, United States. 〈hal-01239546〉

Partager

Métriques

Consultations de la notice

614

Téléchargements de fichiers

518