Title: An accurate generic model to measure of robustness and fragility of networks to random breakdowns

Authors: Farshad Safaei; Hamidreza Sotoodeh

Addresses: Faculty of Computer Science and Engineering, Shahid Beheshti University G.C., Evin 1983963113, Tehran, Iran ' School of Computer Science, Institute for Research in Fundamental Sciences (IPM), P.O. Box 19395-5746, Tehran, Iran

Abstract: Previous attentions on the resilience of random graphs, P2P, and real-life networks have been restricted to approximately find the disconnection probability or they required the computation of NP-complete metrics and also no closed-form solution was available even for the basic networks. Our objective, in this paper, is to highlight the disconnection probability which can arise in such networks. We study the resilience of exponential and real-life networks to the random removal of individual nodes, using an accurate analytical model calculating the exact probability of various networks disconnection facing the malfunctions or local failures which lead to the loss of the global information-carrying ability of these networks. This model is generic and can provide more complete characterisation of the networks robustness. To validate our model and method, we performed sufficient results of Monte-Carlo simulation method and presented an analysis of the effects of the disconnection phenomenon on the overall network's resilience.

Keywords: fault tolerance; network efficiency measures; network reliability; performance assessment; network disconnection; graph theory; generic models; network robustness; network fragility; random breakdowns; disconnection probability; Monte Carlo simulation; network resilience.

DOI: 10.1504/IJMMNO.2016.077063

International Journal of Mathematical Modelling and Numerical Optimisation, 2016 Vol.7 No.2, pp.162 - 188

Received: 05 May 2015
Accepted: 13 Dec 2015

Published online: 18 Jun 2016 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article