4.7 Article

Network resilience of non-hub nodes failure under memory and non-memory based attacks with limited information

期刊

CHAOS
卷 32, 期 6, 页码 -

出版社

AIP Publishing
DOI: 10.1063/5.0092284

关键词

-

资金

  1. National Key Research and Development Program of China [2018YFB2101302]
  2. National Natural Science Foundation of China [12147101, 61973143, 71974080, 71690242]
  3. Young backbone teachers of Jiangsu Province
  4. Jiangsu Postgraduate Research and Innovation Plan [KYCX21_3371]
  5. FACEPE [APQ-0565-1.05/14, APQ-0707-1.05/14]
  6. CAPES
  7. CNPq

向作者/读者索取更多资源

This study investigates the impact of memory and non-memory attack modes in network attacks, revealing that the failure of non-hub nodes is more destructive to the network system, making it more vulnerable. Additionally, the system shows better robustness under non-memory attacks compared to memory attacks, with memory attacks potentially blocking system connectivity more efficiently.
Previous studies on network robustness mainly concentrated on hub node failures with fully known network structure information. However, hub nodes are often well protected and not accessible to damage or malfunction in a real-world networked system. In addition, one can only gain insight into limited network connectivity knowledge due to large-scale properties and dynamic changes of the network itself. In particular, two different aggression patterns are present in a network attack: memory based attack, in which failed nodes are not attacked again, or non-memory based attack; that is, nodes can be repeatedly attacked. Inspired by these motivations, we propose an attack pattern with and without memory based on randomly choosing n non-hub nodes with known connectivity information. We use a network system with the Poisson and power-law degree distribution to study the network robustness after applying two failure strategies of non-hub nodes. Additionally, the critical threshold 1 - p(c) and the size of the giant component S are determined for a network configuration model with an arbitrary degree distribution. The results indicate that the system undergoes a continuous second-order phase transition subject to the above attack strategies. We find that 1 - p(c) gradually tends to be stable after increasing rapidly with n. Moreover, the failure of non-hub nodes with a higher degree is more destructive to the network system and makes it more vulnerable. Furthermore, from comparing the attack strategies with and without memory, the results highlight that the system shows better robustness under a non-memory based attack relative to memory based attacks for n > 1. Attacks with memory can block the system's connectivity more efficiently, which has potential applications in real-world systems. Our model sheds light on network resilience under memory and non-memory based attacks with limited information attacks and provides valuable insights into designing robust real-world systems. Published under an exclusive license by AIP Publishing.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据