复杂网络的一种加权路由策略研究

Research on one weighted routing strategy for complex networks

复杂网络的传输能力是其功能正常运转的重要保障,提高网络的吞吐量有着重要意义.提出一种新的高效路由策略,以提高复杂网络的传输能力,称之为加权路由策略.即对网络的每一条边加权,权值与该边的两端节点的度相关,然后数据包按照这个加权网络的最短路径路由.这样的路径可以更均匀地经过各个节点,发挥它们的传输能力,极大地提高网络的吞吐量.可以避免数据包集中地通过个别度大的节点,在这些节点发生拥塞.仿真显示,该策略比传统的最短路径策略优越,对很多结构的网络,可以提高几十倍的吞吐量.

The efficient functioning of complex networks rely on their traffic capacity, so it is significant to improve their throughput. We propose a new efficient routing strategy called weighted routing strategy to enhance the traffic capacity. Each edge is assigned a value that is related with its end degree. Then packets are transported across the shortest paths of the weighted network. This kind of paths can more evenly go through the vertices and utilize their transport ability. They avoid collectively passing certain vertices which makes them congested, thus the throughput of the network is improved. It is demonstrated by simulations that our strategy is more powerful than the traditional shortest-path strategy, and improves tens of times the throughput for many structures of networks.