A simulation Method for Network Performability Estimation using Heuristically-computed Pathsets and Cutsets

Pablo Sartor 1 Franco Robledo 1
1 DIONYSOS - Dependability Interoperability and perfOrmance aNalYsiS Of networkS
Inria Rennes – Bretagne Atlantique , IRISA-D2 - RÉSEAUX, TÉLÉCOMMUNICATION ET SERVICES
Abstract : Consider a set of terminal nodes K that belong to a network whose nodes are connected by links that fail independently with known probabilities. We introduce a method for estimating any performability measure that depends on the hop distance between terminal nodes. It generalises previously introduced Monte Carlo methods for estimation of the K-reliability of networks with variance reduction compared to crude Monte Carlo. They are based on using sets of edges named d-pathsets and d-cutsets for reducing the variance of the estimator. These sets of edges, considered as a priori known in previous literature, heaviliy affect the attained performance; we hereby introduce and compare a family of heuristics for their selection. Numerical examples are presented, showing the significant efficiency improvements that can be obtained by chaining the edge set selection heuristics to the proposed Monte Carlo sampling plan.
Liste complète des métadonnées

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/hal-00803294
Contributor : Pablo Sartor <>
Submitted on : Thursday, March 21, 2013 - 3:52:13 PM
Last modification on : Thursday, November 15, 2018 - 11:57:38 AM
Document(s) archivé(s) le : Saturday, June 22, 2013 - 6:15:09 AM

Files

RR-8267.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00803294, version 1
  • ARXIV : 1303.5302

Citation

Pablo Sartor, Franco Robledo. A simulation Method for Network Performability Estimation using Heuristically-computed Pathsets and Cutsets. [Technical Report] RR-8267, INRIA. 2013, pp.24. ⟨hal-00803294⟩

Share

Metrics

Record views

424

Files downloads

419