Efficient packet navigation method on scale-free networks with finite and diversiform node delivery capacity

Abstract

Routing strategy is essential for high transport efficiency on realistic networked complex systems. Beginning from the consideration of finite and diversiform node delivery capacity distributions, a general node capacity allocation mechanism with a tunable parameter [Formula: see text] is presented. A node capacity, based routing strategy is proposed to improve the network traffic capacity. Compared with the traditional shortest path routing (SPR) and the efficient routing (ER) methods, it suggests that routing strategy should be chosen heuristically according to the limited capacity resource distribution, instead of using one certain method for all cases. With proper range of parameter [Formula: see text], the new routing strategy achieves the highest traffic capacity and other preferable measure metrics including network diameter, average path length, efficient betweenness, average packet travel time and average traffic load. The theoretical analysis for traffic capacity has a good correspondence to the simulation results. This work studies routing mechanisms from a very practical perspective, and helps network researchers to understand the traffic dynamics on complex networks comprehensively.