A network is a structure where any couple of nodes is normally connected by different independent paths, thus making the structure intrinsically dependable. For this reason, many natural, social and technological systems organize in the form of networks. Critical Infrastructures (CI) form a framework of interconnected and interdependent networks and systems, and, according to the recent literature, can be well represented by two specific topological classes: Random Graphs and Scale Free networks. Network reliability emerges as a critical issue for characterizing a network, but it is also a major challenge since the problem is known to be NP-complete, thus no fast general algorithm is likely to exist. In the last decades, Binary Decision Diagrams (BDD) have provided an extraordinarily efficient technique to encode Boolean functions, and the paper shows how to encode the connectivity function of a graph by means of a BDD with the final aim of evaluating the network reliability. A tool, named NRA (Network Reliability Analyzer) has been developed. NRA embodies different BDD algorithms which are tested and compared throughout scalable benchmarks. Using the NRA tool, the paper investigates the reliability properties of a network as a function of its topology.
|Publication status||Published - 2008|
|Event||9th International Conference on Probabilistic Safety Assessment and Management 2008, PSAM 2008 - , China|
Duration: 1 Jan 2008 → …
|Conference||9th International Conference on Probabilistic Safety Assessment and Management 2008, PSAM 2008|
|Period||1/1/08 → …|
All Science Journal Classification (ASJC) codes
- Safety, Risk, Reliability and Quality
- Statistics and Probability
Bobbio, A., Terruggia, R., Ciancamerla, E., & Minichino, M. (2008). Evaluating network reliability versus topology by means of BDD algorithms. Paper presented at 9th International Conference on Probabilistic Safety Assessment and Management 2008, PSAM 2008, China.