Growing Self-organized Design of Efficient and Robust Complex Networks
arXiv:1411.7719 · doi:10.1109/SASO.2014.17
Abstract
A self-organization of efficient and robust networks is important for a future design of communication or transportation systems, however both characteristics are incompatible in many real networks. Recently, it has been found that the robustness of onion-like structure with positive degree-degree correlations is optimal against intentional attacks. We show that, by biologically inspired copying, an onion-like network emerges in the incremental growth with functions of proxy access and reinforced connectivity on a space. The proposed network consists of the backbone of tree-like structure by copyings and the periphery by adding shortcut links between low degree nodes to enhance the connectivity. It has the fine properties of the statistically self-averaging unlike the conventional duplication-divergence model, exponential-like degree distribution without overloaded hubs, strong robustness against both malicious attacks and random failures, and the efficiency with short paths counted by the number of hops as mediators and by the Euclidean distances. The adaptivity to heal over and to recover the performance of networking is also discussed for a change of environment in such disasters or battlefields on a geographical map. These properties will be useful for a resilient and scalable infrastructure of network systems even in emergent situations or poor environments.
arXiv comment10 pages, 14 figures, 3 tables, Proc. of 2014 IEEE 8th Int. Conf. on Self-Adaptive and Self-Organizing Systems, pp.50-59. http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7001000&tag=1. IEEE Xplore Digital Library 2014
References in corpus (23)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- Assortative mixing in networks
- Catastrophic cascade of failures in interdependent networks
- Attack vulnerability of complex networks
- Universal Behavior of Load Distribution in Scale-free Networks
- Mitigation of Malicious Attacks on Networks
- Cascade control and defense in complex networks
- Robustness of interdependent networks under targeted attack
- Mean-field solution of the small-world network model
- Modelling the Evolution of Human Trail Systems
- Maximal planar networks with large clustering coefficient and power-law degree distribution
- Duplication-divergence model of protein interaction network
- Self-similar disk packings as model spatial scale-free networks
- The robustness of interdependent clustered networks
- Robustness of onion-like correlated networks against targeted attacks
- Onion structure and network robustness
- Complex networks created by aggregation
- Complex scale-free networks with tunable power-law exponent and clustering
- Improvement of the robustness on geographical networks by adding shortcuts
- Growing networks under geographical constraints
- Evolutionary Construction of Geographical Networks with Nearly Optimal Robustness and Efficient Routing Properties
- Self-organized network design by link survivals and shortcuts
Cited by in corpus (8)
- A new design principle of robust onion-like networks self-organized in growth
- Emergence of Robust and Efficient Networks in a Family of Attachment Models
- Spatially self-organized resilient networks by a distributed cooperative mechanism
- Universal vulnerability in strong modular networks with various degree distributions between inequality and equality
- Asymptotic behavior of the node degrees in the ensemble average of adjacency matrix
- Effective Self-Healing Networks against Attacks or Disasters in Resource Allocation Control
- More Tolerant Reconstructed Networks by Self-Healing against Attacks in Saving Resource
- Emergence of an Onion-like Network in Surface Growth and Its Strong Robustness