The Community for Technology Leaders
2013 International Conference on Signal-Image Technology & Internet-Based Systems (2013)
Kyoto, Japan Japan
Dec. 2, 2013 to Dec. 5, 2013
pp: 630-633
ABSTRACT
We investigate analytically the robustness of scale-free networks against overload failures in percolation and cascading processes. Modeling fluctuating loads in a network by random walkers, it is found that there exist two kinds of robustness of networks against overload failures in the percolation process. One is measured by the critical total load W_rmc and the other is by the critical node removal fraction f_rmc. Enhancing the scale-free property, networks become fragile in both senses. In contrast, the increase of the node tolerance parameter makes scale-free networks robust in the sense of W_rmc but fragile in the sense of f_rmc. In addition, we treat the cascading overload process by considering it as a chain of percolation processes. We show that scale-free networks are robust against cascading overload failures modeled by random walkers, which is opposed to most of the previous results.
INDEX TERMS
Cascading Overload Failure, Complex Networks, Robustness, Percolation
CITATION

S. Mizutaka and K. Yakubo, "Overload Network Failures: An Approach from the Random-Walk Model," 2013 International Conference on Signal-Image Technology & Internet-Based Systems(SITIS), Kyoto, Japan Japan, 2014, pp. 630-633.
doi:10.1109/SITIS.2013.103
439 ms
(Ver 3.3 (11022016))