Degree-dependent and cascading node failures in random geometric networks
Degree-dependent and cascading node failures in random geometric networks
复制标题
随机几何网络中的度相关和级联节点故障
DOI：
--
复制
发表时间：
2010
期刊：
影响因子：
--
通讯作者：
E. Yeh
中科院分区：
文献类型：
--
作者：
Z. Kong;E. Yeh
我们研究了随机几何图建模的大规模网络中节点失效的弹性问题。采用一个基于简化的观点，我们研究了网络的能力，以保持全球通信中存在的依赖节点故障。研究了随机几何图上的度依赖站点渗流过程，得到了度依赖节点失效后网络节点的大连通分支的存在性和不存在性的第一个已知解析条件.在电力网络或无线通信和计算网络中，由停电或病毒流行引起的级联故障可能由少数初始节点故障触发影响整个网络的全局故障事件而导致。利用一个简单但描述性的模型，证明了连锁失效问题等价于一个度相关的渗流过程。在具有几何约束的大规模网络中，分别得到了发生和不发生连锁故障的第一解析条件。
We study the problem of resilience to node failures in large-scale networks modelled by random geometric graphs. Adopting a percolation-based viewpoint, we investigates the ability of the network to maintain global communication in the presence of dependent node failures. Degree-dependent site percolation processes on random geometric graphs are examined, and the first known analytical conditions are obtained for the existence and non-existence, respectively, of a large connected component of operational network nodes after degree-dependent node failures. In electrical power networks or wireless communication and computing networks, cascading failure from power blackouts or virus epidemics may result from a small number of initial node failures triggering global failure events affecting the whole network. With the use of a simple but descriptive model, it is shown that the cascading failure problem is equivalent to a degree-dependent percolation process. The first analytical conditions are obtained for the occurrence and non-occurrence of cascading failures, respectively, in large-scale networks with geometric constraints.