期刊文献+

考虑级联失效的复杂负载网络节点重要度评估 被引量:41

Evaluating Node Importance Considering Cascading Failure in Complex Load-networks
下载PDF
导出
摘要 首先提出了一个基于负载重分配的复杂负载网络级联失效模型,与现有模型的区别在于:(1)针对每个节点定义了一个“过载函数”;(2)用节点权值演化代替网络拓扑结构的演化.在级联失效模型基础上,提出了考虑级联失效的复杂负载网络节点重要度评估方法,给出了节点重要度的新定义.该方法有助于发现网络中一些潜在的“关键节点”.最后的实验分析验证了该方法的有效性和可行性. This paper presented a model with "overload function" for cascading failure. The main differences with respect to previous models are as follows: (1) "overload function" is defined for each node, according to the value of "overload function", one node has three states: success, overload, failure. After the load decreases, an overloaded node can be success again. (2) The evolution of topology is replaced by the evolution of value of "overload function" during the process of cascading failure. It's needless to delete the failure nodes and its edges, the load will avoid the failure nodes automatically and the decrease of network performance will be reflected by network efficiency. An evaluation method of node importance considering cascading failure is proposed, and its algorithm is presented. A new definition of node importance is proposed. The most important node is the one whose failure results in the largest decrease of networks efficiency at the end of cascading. The evaluation method can help us to find some potential critical nodes which are sensitive to the efficiency of networks but not so important intuitively. Final example verifies its efficiency and feasibility.
出处 《小型微型计算机系统》 CSCD 北大核心 2007年第4期627-630,共4页 Journal of Chinese Computer Systems
基金 国家自然科学基金项目(70501032)资助.
关键词 级联失效 节点重要度 抗毁性 负载 复杂网络 cascade failure node importance invulnerability load complex networks
  • 相关文献

参考文献15

  • 1Albert R,Barabási A L.Statistical mechanics of complex networks[J].Rev.Mod.Phys,2002,74(1):47-51.
  • 2Albert R,Jeong H Barabási A L.Error and attack tolerance of complex networks[J].Nature,2000,406(6794):378-382.
  • 3Ball M O,Golden B L,Vohra R V.Finding the most vital arcs in a network[J].Oper.Res.Letters,1989,8(2):73-76.
  • 4Malik K,Mittal A K,Gupta S K.The k most vital arcs in the shortest path problem[J].Oper.Res.Letters,1989,8(4):223-227.
  • 5Corley H W,Sha D Y.Most vital links and nodes in weighted networks[J].Oper.Res.Letters,1982,1:157-160.
  • 6Chen Yong,Hu Ai-qun,Hu Jun,et al.A method for finding the most vital node in communication networks[J].High Technology Letters,2004,14(1):21-24.
  • 7Wu Jun,Tan Yue-jin.Finding the most vital node by node contraction in communication networks[C].In:Proceeding of IEEE ICCCAS 2005.Hong Kong,2005,1283-1286.
  • 8Motter A E,Lai Y C.Cascade-based attacks on complex networks[J].Phys.Rev.E,2002,66(8):65-102.
  • 9Zhao L,Kwangho P,Lai Y C.Attack vulnerability of scale-free networks due to cascading breakeown[J].Phys.Rev.E,2004,70(3):35-101.
  • 10Pastor-Satorras R,Vazquez A,Vespignani A.Dynamical and correlation properties of the internet[J].Phys.Rev.Lett.,2001,87(25):258-701.

同被引文献354

引证文献41

二级引证文献338

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部