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

通信网中最重要节点的确定方法
引用本文:陈勇,胡爱群,胡骏,陈立全.通信网中最重要节点的确定方法[J].高技术通讯,2004,14(1):21-24.
作者姓名:陈勇  胡爱群  胡骏  陈立全
作者单位:东南大学无线电工程系,南京,210096
基金项目:863计划 ( 2 0 0 2AA14 3 0 10 ),教育部优秀青年教师计划资助项目
摘    要:提出了一种确定通信网中最重要节点的方法——节点删除法,并给出了归一化的表达式。最重要的节点是去掉该节点以及相关联的链路后,使得图的生成树数目最小。节点删除法反映了某个节点失效时,对整个通信网可靠性的破坏程度。该方法可以评价全网范围内的节点重要性,通过比较生成树的数目,可以判断通信网中任意两个节点的相对重要性。实验结果证明了节点删除法的有效性。

关 键 词:通信网  可靠性  节点删除  生成树  归一化

A Method for Finding the Most Vital Node in Communication Networks
Chen Yong,Hu Aiqun,Hu Jun,Chen Liquan.A Method for Finding the Most Vital Node in Communication Networks[J].High Technology Letters,2004,14(1):21-24.
Authors:Chen Yong  Hu Aiqun  Hu Jun  Chen Liquan
Abstract:A node-deletion method for finding the most vital node in communication networks is proposed. A generalized expression for computing the node score is given. The most vital node is the one whose removal with its incident links decreases the number of spanning trees most drastically and whose loss impacts the system reliability most seriously. This method ranks the node importance over all nodes in a network. The relative importance of two nodes in a graph is compared in terms of the number of spanning trees. Experimental results show that the proposed node-deletion method can identify the most vital node in a network efficiently.
Keywords:Communication networks  Reliability  Node-deletion  Spanning tree  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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