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

Author:

Dong Gaogao1ORCID,Wang Nan1,Wang Fan12,Qing Ting1,Liu Yangyang3,Vilela André L. M.4ORCID

Affiliation:

1. School of Mathematical Sciences, Jiangsu University, Zhenjiang 212013, Jiangsu, China

2. Department of Physics, Bar-Ilan University, Ramat-Gan 52900, Israel

3. Academy of Military Science, Beijing 100097, China

4. Física de Materiais, Universidade de Pernambuco, Recife, Pernambuco 50100-010, Brazil

Abstract

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 [Formula: see text] 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 [Formula: see text] and the size of the giant component [Formula: see text] 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 [Formula: see text] gradually tends to be stable after increasing rapidly with [Formula: see text]. 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 [Formula: see text]. 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.

Funder

National Natural Science Foundation of China

Fundação de Amparo à Ciência e Tecnologia do Estado de Pernambuco

Jiangsu Postgraduate Research and Innovation in 2021

Young backbone teachers of Jiangsu Province

Publisher

AIP Publishing

Subject

Applied Mathematics,General Physics and Astronomy,Mathematical Physics,Statistical and Nonlinear Physics

Reference37 articles.

1. Ecological network analysis: network construction

2. Molecular ecological network analyses

3. J. Kim, S. Radhakrishnan, and S. K. Dhall, “Measurement and analysis of worm propagation on internet network topology,” in Proceedings of the 13th International Conference on Computer Communications and Networks (IEEE Cat. No. 04EX969) (IEEE, 2004), pp. 495–500.

4. Propagation of computer virus both across the Internet and external computers: A complex-network approach

5. Detection of topological patterns in complex networks: correlation profile of the internet

Cited by 3 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3