6,995 research outputs found
Enhancing network robustness for malicious attacks
In a recent work [Proc. Natl. Acad. Sci. USA 108, 3838 (2011)], the authors
proposed a simple measure for network robustness under malicious attacks on
nodes. With a greedy algorithm, they found the optimal structure with respect
to this quantity is an onion structure in which high-degree nodes form a core
surrounded by rings of nodes with decreasing degree. However, in real networks
the failure can also occur in links such as dysfunctional power cables and
blocked airlines. Accordingly, complementary to the node-robustness measurement
(), we propose a link-robustness index (). We show that solely
enhancing cannot guarantee the improvement of . Moreover, the
structure of -optimized network is found to be entirely different from
that of onion network. In order to design robust networks resistant to more
realistic attack condition, we propose a hybrid greedy algorithm which takes
both the and into account. We validate the robustness of our
generated networks against malicious attacks mixed with both nodes and links
failure. Finally, some economical constraints for swapping the links in real
networks are considered and significant improvement in both aspects of
robustness are still achieved.Comment: 6 pages, 6 figure
Spatially self-organized resilient networks by a distributed cooperative mechanism
The robustness of connectivity and the efficiency of paths are incompatible
in many real networks. We propose a self-organization mechanism for
incrementally generating onion-like networks with positive degree-degree
correlations whose robustness is nearly optimal. As a spatial extension of the
generation model based on cooperative copying and adding shortcut, we show that
the growing networks become more robust and efficient through enhancing the
onion-like topological structure on a space. The reasonable constraint for
locating nodes on the perimeter in typical surface growth as a self-propagation
does not affect these properties of the tolerance and the path length.
Moreover, the robustness can be recovered in the random growth damaged by
insistent sequential attacks even without any remedial measures.Comment: 34 pages, 12 figures, 2 table
- β¦