Literature DB >> 30050045

Onion-like networks are both robust and resilient.

Yukio Hayashi1, Naoya Uchiyama2.   

Abstract

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.

Entities:  

Year:  2018        PMID: 30050045      PMCID: PMC6062544          DOI: 10.1038/s41598-018-29626-w

Source DB:  PubMed          Journal:  Sci Rep        ISSN: 2045-2322            Impact factor:   4.379


  17 in total

1.  Assortative mixing in networks.

Authors:  M E J Newman
Journal:  Phys Rev Lett       Date:  2002-10-28       Impact factor: 9.161

2.  Robustness of onionlike correlated networks against targeted attacks.

Authors:  Toshihiro Tanizawa; Shlomo Havlin; H Eugene Stanley
Journal:  Phys Rev E Stat Nonlin Soft Matter Phys       Date:  2012-04-17

3.  Catastrophic cascade of failures in interdependent networks.

Authors:  Sergey V Buldyrev; Roni Parshani; Gerald Paul; H Eugene Stanley; Shlomo Havlin
Journal:  Nature       Date:  2010-04-15       Impact factor: 49.962

4.  Understanding and preventing cascading breakdown in complex clustered networks.

Authors:  Liang Huang; Ying-Cheng Lai; Guanrong Chen
Journal:  Phys Rev E Stat Nonlin Soft Matter Phys       Date:  2008-09-30

5.  Mitigation of malicious attacks on networks.

Authors:  Christian M Schneider; André A Moreira; José S Andrade; Shlomo Havlin; Hans J Herrmann
Journal:  Proc Natl Acad Sci U S A       Date:  2011-02-22       Impact factor: 11.205

6.  Simple and efficient self-healing strategy for damaged complex networks.

Authors:  Lazaros K Gallos; Nina H Fefferman
Journal:  Phys Rev E Stat Nonlin Soft Matter Phys       Date:  2015-11-10

7.  Identifying optimal targets of network attack by belief propagation.

Authors:  Salomon Mugisha; Hai-Jun Zhou
Journal:  Phys Rev E       Date:  2016-07-11       Impact factor: 2.529

8.  Bypass rewiring and robustness of complex networks.

Authors:  Junsang Park; Sang Geun Hahn
Journal:  Phys Rev E       Date:  2016-08-22       Impact factor: 2.529

9.  Onion structure and network robustness.

Authors:  Zhi-Xi Wu; Petter Holme
Journal:  Phys Rev E Stat Nonlin Soft Matter Phys       Date:  2011-08-05

10.  Limits of Predictability of Cascading Overload Failures in Spatially-Embedded Networks with Distributed Flows.

Authors:  A Moussawi; N Derzsy; X Lin; B K Szymanski; G Korniss
Journal:  Sci Rep       Date:  2017-09-15       Impact factor: 4.379

View more
  2 in total

1.  More Tolerant Reconstructed Networks Using Self-Healing against Attacks in Saving Resource.

Authors:  Yukio Hayashi; Atsushi Tanaka; Jun Matsukubo
Journal:  Entropy (Basel)       Date:  2021-01-12       Impact factor: 2.524

2.  A growth model for water distribution networks with loops.

Authors:  Kashin Sugishita; Noha Abdel-Mottaleb; Qiong Zhang; Naoki Masuda
Journal:  Proc Math Phys Eng Sci       Date:  2021-11-24       Impact factor: 2.704

  2 in total

北京卡尤迪生物科技股份有限公司 © 2022-2023.