School of Mathematical Sciences, Jiangsu University, Zhenjiang 212013, Jiangsu, China.
Academy of Military Science, Beijing 100097, China.
Chaos. 2022 Jun;32(6):063110. doi: 10.1063/5.0092284.
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 - 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 - 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.
先前关于网络鲁棒性的研究主要集中在具有完全已知网络结构信息的枢纽节点故障上。然而,在现实网络系统中,枢纽节点通常受到很好的保护,不易受到损坏或故障的影响。此外,由于网络本身的大规模特性和动态变化,人们只能获得有限的网络连通性知识。特别是,网络攻击存在两种不同的攻击模式:基于记忆的攻击,即不再攻击失败的节点,或非基于记忆的攻击,即可以重复攻击节点。受这些动机的启发,我们提出了一种基于随机选择具有已知连通性信息的 n 个非枢纽节点的基于记忆和无记忆的攻击模式。我们使用具有泊松和幂律度分布的网络系统来研究在应用两种非枢纽节点失效策略后网络的鲁棒性。此外,还确定了具有任意度分布的网络配置模型的临界阈值 1 - 和巨分支 S 的大小。结果表明,系统经历了连续的二级相变,受到上述攻击策略的影响。我们发现,1 - 在 n 增加后迅速增加后逐渐趋于稳定。此外,具有较高度数的非枢纽节点的失效对网络系统的破坏性更大,使其更脆弱。此外,通过比较具有和不具有记忆的攻击策略,结果表明,在 n > 1 的情况下,非记忆攻击相对于记忆攻击,系统表现出更好的鲁棒性。具有记忆的攻击可以更有效地阻止系统的连通性,这在现实系统中有潜在的应用。我们的模型阐明了在具有有限信息攻击的基于记忆和非记忆攻击下的网络弹性,并为设计鲁棒的现实系统提供了有价值的见解。