基于节点疏远方法的网络节点重要性评价
收稿日期: 2010-04-20
修回日期: 2010-08-09
网络出版日期: 2011-03-25
基金资助
国家973计划资助项目
Evaluating the Vital Network Nodes Based on Node Estranging
Received date: 2010-04-20
Revised date: 2010-08-09
Online published: 2011-03-25
互联网本质上是一种异质网络，其面对恶意攻击是“鲁棒而脆弱的”，对节点的重要性进行评价是增强网络抗攻击能力的基础。本文在分析现有常见方法存在不足的基础上，提出了一种称之为节点疏远的方法来评价节点重要性。该方法对需评价重要性的节点的关联边进行合理疏远，然后定义了一种既体现节点全局位置信息又体现节点局部连接特性的重要性度量，用这个度量对节点重要性进行评估。利用节点疏远后全网络效率变化量和通过待评价节点的路径的效率变化量之和相等的特点，降低了直接使用前述度量评价节点重要性的计算复杂度。仿真表明，节点疏远法能够较好地评价节点的重要性，其评价结果更精确。
刘建强，兰巨龙，邬江兴 . 基于节点疏远方法的网络节点重要性评价[J]. 计算机工程与科学, 2011 , 33(3) : 13 -17 . DOI: 10.3969/j.issn.1007130X.2011.
The Internet is essentially a heterogeneous network, and is robust and fragile .Evaluating the importance of the nodes is a critical foundation for the ability of antiattacks. The paper analyzes the shortcomings of the existing methods and proposes a method known as the node estranging method, through estranging the link weight .A new metric is proposed which reflects the node location information in the whole network and the local connectivity. And the computing complexity is reduced with the characteristics that the total of the varieties of network efficiency is equal to the sum of the varieties of path efficiency through the node. Simulation results show that the node estranging method can better evaluate the importance of the node with finer granularity to other methods.
［1］Faloutsos M,Faloutsos P,Foloutsos C.On PowerLaw Relationships of the Internet Topology［C］∥Proc of ACM SIGCOMM Conf,1999:251262.
［2］Grubesic T H, Murray A T. Vital Nodes,Interconnected Infrastructures,and the Geographies of Network Survivability［J］.Annals of the Association of American Geographers,2006, 96(1):6483.
［3］Knoke D,Burt R S. Applied Network Analysis:A Methodological Introduction［M］.Newbury Park,1983.
［4］Albert R ,Jeong H ,Barabasi A L . Error and Attack Tolerance of Complex Networks［J］. Nature,2000, 406(27):378382.
［5］Reuven C,Keren E,Daniel B,et al.Resilience of the Internet to Random Breakdowns［J］. Phys Rev Lett,2000,85(21):46264628.
［6］Corley H，Sha D．Most Vital Links and Nodes in Weighted Networks［J］.Operations Research Letters,1982,1(4):157160.
［7］Nardelli E, Proietti G, Widmayer P. Finding the Most Vital Node of a Shortest Path［C］∥Proc of Computing and Combinatorics,2001:278287．
［8］Freeman L C．A Set of Measures of Centrality Based Upon Betweenness［J］．Sociometry，1977，40(1)：3541．
［9］陈勇,胡爱群,胡骏.通信网中节点重要性的评价方法［J］.通信学报,2004,25(8):129134.
［10］Chen Y，Hu A Q，Yip K W，et al．Finding the Most Vital Node with Respect to the Number of Spanning Trees［C］∥Proc of IEEE Int’l Conf on Neural Networks and Signal Processing，2003:16701673.
［11］谭跃进,吴俊,邓宏钟.复杂网络中节点重要度评估的节点收缩方法［J］.系统工程理论与实践, 2006,26(11):7983.
［12］安世虎,都艺兵,曲吉林.节点集重要性测度综合法及其在知识共享网络中的应用［J］.中国管理科学,2006,14（1）:106111.
［13］吴俊,谭跃进.复杂网络抗毁性测度研究［J］.系统工程学报，2005, 20(2):128131.
［14］Crucitti P, Latora V, Marchiori M, et al. Efficiency of ScaleFree Networks: Error and Attack Tolerance［J］. Physical A, 2003, 320:622642.
［15］Watts D J,Strogatz S H. Collective Dynamics of SmallWorld Networks［J］. Nature 1998,393(4):440442.
［16］Page L B, Perry J E.Reliability Polynomials and Links Importance in Networks［J］．IEEE Trans on Reliability,1994,43(1)：5158.
［17］余新,李艳和,郑小平,等.基于网络性能变化梯度的通信网络节点重要程度评价方法［J］. 清华大学学报(自然科学版), 2008,48(4):541544.
/
| 〈 |
|
〉 |