面向相继故障的复杂网络上袭击策略研究

针对复杂网络遭遇随机故障和蓄意攻击引发的相继故障问题,采用网络中节点j上的初始负荷为Lj=βkjα(这里kj表示为节点j的度,α和β是可调参数),并基于崩溃节点负荷局域择优重新分配的原则,提出了一个带有可调参数的相继故障模型.通过度量网络鲁棒性的一个新的指标,即:关键阈值Tc,对比了两种袭击策略下网络上的全局相继故障现象.数值模拟得到了一些有趣而又违背直觉的结论:一方面,当模型中的可调参数α<1时,袭击网络中度最小的节点比袭击度最大的节点更易导致相继故障;而另一方面,当α=1时,两种袭击对网络的破坏几乎是相同的.此外,数值模拟结果也得到了理论解析的验证.

Cascade-Oriented Attack on Complex Networks

In or der t o discuss cascading failur es on compl ex net works subject to random failures or att acks, adopting the initial load of a node j to be L_j=Bk_j^A(k_j is the degree of node j, Aand Bare tunable parameters), a cascading model with a tunable parameter is proposed based on the local preferential redist ribution rule of the load of a broken node.According to a new measure, i.e., the critical threshold T_c, we compare the effects of two at tacks for the universal robust ness.Numerical simulat ions draw some interesting and counterintuit ive results.On the one hand, the at tack at the node with the lowest degree is more likely to trigger cascading failures than the one at the highest degree nodes when A<1; while on the other hand, when A=1, the effects of two at tacks for the robustness against cascading failures are almost identical.In addition, numerical simulations are also verified by theoretical analysis.