Optimization of transport protocols in complex networks
Optimization of transport protocols in complex networks
复制标题
DOI：
10.1016/j.physa.2012.01.003
复制
发表时间：
2012-06
影响因子：
3.3
通讯作者：
Long Chen;Jiancong Chen;Z. Guan;Xian-He Zhang;Ding-Xue Zhang
中科院分区：
文献类型：
--
作者：
Long Chen;Jiancong Chen;Z. Guan;Xian-He Zhang;Ding-Xue Zhang
本文提出了一种提高复杂网络通信容量的最优路由策略。为了避免节点过载，新算法的基础上推导出广义介数中心性，它给出了一个估计的流量处理的节点的路由集。由于介数中心度大的节点更容易受到流量拥塞的影响，在计算集合路由表的过程中，通过将流量负载从介数中心度大的节点重新分配到介数中心度小的节点，可以改善网络流量.特别地，通过一个控制优化尺度的参数，新的路由不仅能进一步扩大网络的业务容量，而且能以较小的平均路径长度提高业务效率。通过与以往路由策略的比较，表明改进后的路由策略具有更好的性能。
In this paper, an optimal routing strategy is proposed to enhance the traffic capacity of complex networks. In order to avoid nodes overloading, the new algorithm is derived on the basis of generalized betweenness centrality which gives an estimate of traffic handled by the node for a route set. Since the nodes with large betweenness centrality are more susceptible to traffic congestion, the traffic can be improved, as our strategy, by redistributing traffic load from nodes with large betweenness centrality to nodes with small betweenness centrality in the proceeding of computing collective routing table. Particularly, depending on a parameter that controls the optimization scale, the new routing can not only enlarge traffic capacity of networks more, but also enhance traffic efficiency with smaller average path length. Comparing results of previous routing strategies, it is shown that the present improved routing performs more effectively.