An efficient probability routing algorithm for scale-free networks

To better utilize hub nodes within a network, this paper proposed an efficient probability (EP) routing algorithm which features using the importance degree to target critical nodes and subsequently redistribute incoming packets. Simulation results reveal that the proposed strategy is able to improve the network capacity in comparison to the shortest path (SP) routing strategy and the centrality-degree-based probability path (PP) routing algorithm. Moreover, the average routing path length of the EP is over 30% shorter than that of the PP, though it is 10% longer than that of the SP.