首页 | 本学科首页   官方微博 | 高级检索  
     检索      

相依网络上基于相连边的择优恢复算法
引用本文:吴佳键,龚凯,王聪,王磊.相依网络上基于相连边的择优恢复算法[J].物理学报,2018,67(8):88901-088901.
作者姓名:吴佳键  龚凯  王聪  王磊
作者单位:1. 西南财经大学经济信息工程学院, 成都 611130; 2. 西南财经大学, 互联网金融创新及监管协同创新中心, 成都 611130; 3. 西南财经大学, 金融智能与金融工程四川省重点实验室, 成都 611130; 4. 四川师范大学, 可视化计算与虚拟现实四川省重点实验室, 成都 610068
基金项目:国家自然科学基金(批准号:61602331)、中央高校基本科研业务费(批准号:JBK170133)和四川省教育厅科研基金(批准号:J17ZB0434)资助的课题.
摘    要:如何有效地应对和控制故障在相依网络上的级联扩散避免系统发生结构性破碎,对于相依网络抗毁性研究具有十分重要的理论价值和现实意义.最新的研究提出一种基于相依网络的恢复模型,该模型的基本思想是通过定义共同边界节点,在每轮恢复阶段找出符合条件的共同边界节点并以一定比例实施恢复.当前的做法是按照随机概率进行选择.这种方法虽然简单直观,却没有考虑现实世界中资源成本的有限性和择优恢复的必然性.为此,针对相依网络的恢复模型,本文利用共同边界节点在极大连通网络内外的连接边数计算边界节点的重要性,提出一种基于相连边的择优恢复算法(preferential recovery based on connectivity link,PRCL)算法.利用渗流理论的随机故障模型,通过ER随机网络和无标度网络构建的不同结构相依网络上的级联仿真结果表明,相比随机方法和度数优先以及局域影响力优先的恢复算法,PRCL算法具备恢复能力强、起效时间早且迭代步数少的优势,能够更有效、更及时地遏制故障在网络间的级联扩散,极大地提高了相依网络遭受随机故障时的恢复能力.

关 键 词:相依网络  级联失效  恢复模型  择优算法
收稿时间:2017-11-24

Enhancing resilience of interdependent networks against cascading failures under preferential recovery strategies
Wu Jia-Jian,Gong Kai,Wang Cong,Wang Lei.Enhancing resilience of interdependent networks against cascading failures under preferential recovery strategies[J].Acta Physica Sinica,2018,67(8):88901-088901.
Authors:Wu Jia-Jian  Gong Kai  Wang Cong  Wang Lei
Abstract:Interdependent networks are extremely fragile because a very small node failure in one network would trigger a cascade of failures in the entire system. Therefore, the resilience of interdependent networks is always a critical issue studied by researchers in different fields. Existing studies mainly focused on protecting several influential nodes for enhancing robustness of interdependent networks before the networks suffer random failures. In reality, it is necessary to repair a failing interdependent network in time to prevent it from suffering total breakdown. Recent investigations introduce a failure-recovery model for studying the concurrent failure process and recovery process of interdependent networks based on a random recovery strategy. This stochastic strategy covers repairing a small fraction of mutual boundary nodes which are the failed neighbors of the giant connected component of each network, with a random probability of recovery γ. Obviously, the random recovery is simple and straightforward. Here, we analyze the recovery process of interdependent networks with two types of connectivity links, i.e., the first-type connectivity links and the second-type connectivity links, which represent the mutual boundary nodes(being also failed nodes) linked to survival nodes in current giant connected component, and linked to failed nodes out of current giant connected component in networks, respectively. We find that when mutual boundary nodes have more first-type connectivity links, the current giant connected component has higher average degree and immediately makes better interdependent network resilience, on the other hand, more second-type connectivity links generate more candidates during the recovery procedure, and indirectly make better system resilience. In short, two types of connectivity links of mutual boundary nodes both have great effects on the resilience of interdependent networks during the recovery. In this paper, we propose a new recovery strategy (preferential recovery based on connectivity link, or PRCL) to identify the mutual boundary node recovery influence in interdependent networks, based on the failure-recovery model. By defining two indexes that represent the numbers of first-type and links second-type connectivity links, respectively, we calculate the boundary influence with one parameter f by combining together with two indexes. After calculating all boundary nodes in the current process, we obtain a boundary importance index which is more accurate to indicate recovery influence of boundary node for each boundary node in interdependent networks. Our strategy is applied to interdependent networks constructed by ER random network or/and scale-free network with the same average degree. And a dynamical model of random failure based on percolation theory is used to make a comparison of performance between PRCL and other recovery strategies(including random recovery, preferential recovery based on degree, preferential recovery based on local centrality) in terms of four quantitative indices, i.e., probability of existence of the giant connected component, number of iteration steps, recovery robustness and average degree of the steady state of the giant connected component. Experiments on different interdependent networks (ER-ER/SF-SF/ER-SF/SF-ER) demonstrate that with a very small number of mutual boundary node recoveries by PRCL strategy, the resilience and robustness of entire system under the recovery process can be greatly enhanced. Finally, the only parameter f in PRCL strategy is also discussed. Our strategy is meaningful in practice as it can largely enhance interdependent network resilience and contribute to the decrease of system breakdown risk.
Keywords:interdependent networks  cascading failures  failures-recovery model  preferential recovery strategy
本文献已被 CNKI 等数据库收录!
点击此处可从《物理学报》浏览原始摘要信息
点击此处可从《物理学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号