Abstract

We propose a novel capacity model for complex networks against cascading failure. In this model, vertices with both higher loads and larger degrees should be paid more extra capacities, i.e. the allocation of extra capacity on vertex $i$ will be proportional to $ k_{i}^{\gamma} $, where $ k_{i}$ is the degree of vertex $i$ and $\gamma>0$ is a free parameter. We have applied this model on Barab\'asi-Albert network as well as two real transportation networks, and found that under the same amount of available resource, this model can achieve better network robustness than previous models.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.