Optimal Routing Strategy Based on Specifying Shortest Path

摘要

How to enhance the transfer capacity of weighted networks is of great importance. The network transfer capacity, which is often evaluated by the critical packet generation rate, is proved to be inversely proportional to the highest node betweenness. By specifying the shortest path according to the different node characteristics, two different routing strategies are proposed to reduce the high node betweenness for the different node delivery capability schemes. Simulations on both computer-generated networks and real world networks show that our routing strategies can improve the network transfer capacity greatly. Especially, the greater the new added edge number is, the more efficient our routing strategies are.