基于节点流量及路径评估网络节点重要性的优化算法  

A Method about Node Importance Evaluation Based on Flow and Path for Network

作　　者：张品[1] 董志远[1] 沈政[1] 

机构地区：[1]杭州电子科技大学通信学院,杭州310018

出　　处：《计算机系统应用》2012年第12期103-107,共5页Computer Systems & Applications

摘　　要：如何合理有效地评估通信网络中各节点的重要性,对整个网络的设计至关重要.在以往相关理论研究的基础上,提出了一种基于网络传输流量和网络节点间两两最短距离的新算法—DFC算法(Combination of transmission flow and shortest path distance).该算法从每个节点在通信网络中所占的通信流量,及节点失效后两两间最短距离的变化出发,来反映该节点对整个通信网络的重要程度.通过实验仿真,并与目前最通用有效的节点删除法相比,证明该方法具有更高的精确性,是一种有效的方法.How to evaluate the importance of each node effectively in the network, is very important to the design of the whole network. A new algorithm based on transmission flow and the shortest distance between two nodes in the network is proposed in this article--DFC algorithm. This method takes the flow of each node and the shortest distance between two nodes into account, evaluating each nodal importance to the network of the whole communication. Through the experimental simulation and the comparison with the general effective delete node method, this method is proved to have higher accuracy and more effective.

关 键 词：通信网 节点重要性 DFC 网络传输特性 最短距离 

分 类 号：TN915.0[电子电信—通信与信息系统]