首页
登录
注册
一种复杂网络路由策略的普适优化算法
A p ervasive optimized algorithm for complex network routing strategy
-
摘要: 现有的复杂网络路由策略很多，改进算法也不断涌现，但是目前还没有一个统一的标准来衡量算法是否达到网络最佳传输效果。针对这一问题，本文提出一种适用于现有路由策略的普适优化算法。首先通过理论分析指出制约网络传输能力的关键因素是最大介数中心度，因而“最大介数中心度是否已经最低”成为评判路由策略是否最优的标准。在此基础上，采用“惩罚选择法”避开网络中介数中心度值比较大的节点，使网络介数中心度值分布更均匀，均衡网络中各个节点的传输负载。仿真结果显示，该优化算法针对现有路由策略均能降低最大介数中心度值，大幅度提高网络的传输能力。Abstract: There are many existing routing strategies in complex networks, but there is no uniform standard to measure whether the strategies achieve optimal transmission effect. A pervasive optimized algorithm is proposed. The key factor restricting transmission capacity is maximum betweenness centrality and minimizing it becomes the uniform standard. In order to make betweenness centrality more evenly distributed and balance the traffic load of each node, we use punishment selection method to avoid the nodes with larger betweenness centrality. The simulation results show that the new algorithm could reduce maximum betweenness centrality of existing strategies and improve the network transmittability greatly.
-
-
计量
- 文章访问数: 472
- HTML全文浏览数: 47
- PDF下载数: 0
- 施引文献: 0
下载: