Optimal Routing Strategy on Scale-free Networks with Heterogeneous Delivering Capacity

Abstract

We proposed the information traffic dynamics on scale-free networks considering the heterogeneous delivering capacity. In the previous researches, the delivering capacity is the same for all nodes in the system, which obviously contradicts the real observations. In this paper, a heuristic algorithm for the optimization of transport is proposed to enhance traffic efficiency in complex networks, where each node's capacity is set as i c = i k and i k is the degree of nodei. Our algorithm balances traffic on a scalefree network by minimizing the maximum effective betweenness, which can avoid or reduce the overload in some busy nodes. The simulation result shows that the network capacity can reach a very high value, which is four times more than that of the efficient routing strategy. The distribution of traffic load is also studied and it is found that our optimal routing strategy can make a good balance between hub nodes and non-hub nodes, resulting in high network capacity.