Effective Gravitation Path Routing Strategy on Scale-Free Networks

Information routing strategy is a hot issue in the study of complex network traffic dynamics. In this paper, we define a new gravitational centrality and introduce parameter $\alpha _{1}$ to control the centrality of nodes. When $\alpha _{1}$ is appropriate value, the gravitational centrality has the function of dividing the centrality of the same degree nodes. According to the gravitational centrality, we propose an effective gravitation path routing strategy in which the optimal paths between all pairs of nodes are chosen according to a cost function that incorporates gravitational centrality of nodes in paths. The purpose of this strategy is to improve network traffic capacity. The simulation results on the scale-free networks show that our routing strategy is more effective than the efficient routing strategy proposed by Yan et al. [Phys. Rev. E, Stat. Phys. Plasmas Fluids Relat. Interdiscip. Top. 73, 046108 (2006)].