Onion-like networks are both robust and resilient

Tolerant connectivity and flow transmission within capacity are crucial functions as network. However, the threats to malicious attacks based on intelligent node selections and rapid breakdown by cascading overload failures increase more and more with large blackout or congestion in our contemporary networking systems and societies. It has been recently suggested that interwoven loops protect the network functions from such damages, but it is a computationally intractable combinatorial problem to maximize a set of necessary nodes for loops in order to improve the robustness. We propose a new method by enhancing loops in the incremental growth for constructing onion-like networks with positive degree-degree correlations, whose topological structure has the optimal tolerance of connectivity against attacks in the state-of-the-art. Moreover, we find out that onion-like networks acquire adaptive capacity in resilience by a change of routing policy for flow control to absorb cascading overload failures triggered by a single attack and simultaneous multi-attacks. The inhibitory effect is stronger than that in scale-free networks found in many real systems.

[1]  John Kyle Dorton,et al.  Extreme Toyota : radical contradictions that drive success at the world's best manufacturer , 2008 .

[2]  Tao Zhou,et al.  A limited resource model of fault-tolerant capability against cascading failure of complex network , 2007, 0708.4023.

[3]  Hans J. Herrmann,et al.  Mitigation of malicious attacks on networks , 2011, Proceedings of the National Academy of Sciences.

[4]  Haipeng Peng,et al.  Robustness of Interrelated Traffic Networks to Cascading Failures , 2014, Scientific Reports.

[5]  Ziyou Gao,et al.  How non-uniform tolerance parameter strategy changes the response of scale-free networks to failures , 2007 .

[6]  Nina H. Fefferman,et al.  Simple and efficient self-healing strategy for damaged complex networks , 2015, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  Yukio Hayashi,et al.  Growing Self-Organized Design of Efficient and Robust Complex Networks , 2014, 2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems.

[8]  Steven B. Andrews,et al.  Structural Holes: The Social Structure of Competition , 1995, The SAGE Encyclopedia of Research Design.

[9]  Harry Eugene Stanley,et al.  Robustness of onion-like correlated networks against targeted attacks , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  David Woods,et al.  Resilience Engineering: Concepts and Precepts , 2006 .

[11]  Massimo Marchiori,et al.  Error and attacktolerance of complex network s , 2004 .

[12]  Shiyong Zhang,et al.  Robustness of networks against cascading failures , 2010 .

[13]  Carl Folke,et al.  The emergence of a perspective for social-ecological systems analyses , 2006 .

[14]  T. Nishiguchi,et al.  Case Study The Toyota Group and the Aisin Fire 49 , 2008 .

[15]  Yukio Hayashi,et al.  Spatially self-organized resilient networks by a distributed cooperative mechanism , 2016, ArXiv.

[16]  C. Folke RESILIENCE: THE EMERGENCE OF A PERSPECTIVE FOR SOCIAL-ECOLOGICAL SYSTEMS ANALYSES , 2006 .

[17]  Guanrong Chen,et al.  Understanding and preventing cascading breakdown in complex clustered networks. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  Reka Albert,et al.  Mean-field theory for scale-free random networks , 1999 .

[19]  Ziyou Gao,et al.  Cascade defense via navigation in scale free networks , 2007 .

[20]  A. Saxenian The New Argonauts: Regional Advantage in a Global Economy , 1994 .

[21]  Yukio Hayashi A new design principle of robust onion-like networks self-organized in growth , 2018, Netw. Sci..

[22]  Hai-Jun Zhou,et al.  Spin glass approach to the feedback vertex set problem , 2013, 1307.6948.

[23]  Adilson E Motter Cascade control and defense in complex networks. , 2004, Physical review letters.

[24]  Sang Geun Hahn,et al.  Bypass rewiring and robustness of complex networks. , 2016, Physical review. E.

[25]  Alexandre Beaudet,et al.  Fractal Design: Self-organizing Links in Supply Chain Management , 2000 .

[26]  Hernán A. Makse,et al.  Influence maximization in complex networks through optimal percolation , 2015, Nature.

[27]  M E J Newman Assortative mixing in networks. , 2002, Physical review letters.

[28]  Guilhem Semerjian,et al.  Network dismantling , 2016, Proceedings of the National Academy of Sciences.

[29]  Hai-Jun Zhou,et al.  Identifying optimal targets of network attack by belief propagation , 2016, Physical review. E.

[30]  Petter Holme,et al.  Onion structure and network robustness , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[31]  Harry Eugene Stanley,et al.  Catastrophic cascade of failures in interdependent networks , 2009, Nature.

[32]  A. Vespignani Predicting the Behavior of Techno-Social Systems , 2009, Science.

[33]  José-Luis Marzo,et al.  Robustness Comparison of 15 Real Telecommunication Networks: Structural and Centrality Measurements , 2016, Journal of Network and Systems Management.

[34]  R. Pastor-Satorras,et al.  Generation of uncorrelated random scale-free networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[35]  Alexandre Beaudet,et al.  The Toyota Group and the Aisin Fire , 1998 .

[36]  Boleslaw K. Szymanski,et al.  Limits of Predictability of Cascading Overload Failures in Spatially-Embedded Networks with Distributed Flows , 2017, Scientific Reports.

[37]  Toshiyuki Miyazaki,et al.  Emergent rewirings for cascades on correlated networks , 2005 .