An accurate generic model to measure of robustness and fragility of networks to random breakdowns Online publication date: Mon, 20-Jun-2016
by Farshad Safaei; Hamidreza Sotoodeh
International Journal of Mathematical Modelling and Numerical Optimisation (IJMMNO), Vol. 7, No. 2, 2016
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.
Online publication date: Mon, 20-Jun-2016
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematical Modelling and Numerical Optimisation (IJMMNO):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org