Delivering capacity allocation strategy for traffic dynamics on scale-free networks
Abstract
The traffic dynamics of complex networks are largely determined by the node’s resource distribution. In this paper, based on the shortest path routing strategy, a node delivering capacity distribution mechanism is proposed into the traffic dynamics in Barabási and Albert (BA) scale-free networks; the efficiency of the mechanism on the network capacity measured by the critical point (Rc) of phase transition from free flow to congestion is primarily explored. Based on the proposed strategy, the total delivering capacity is reallocated according to both degree and betweenness of each node, and an optimal value of parameter αc is found, leading to the maximum traffic capacity. The results of numerical experiments on scale-free networks suggest that the resource allocation strategy proposed here is capable of effectively enhancing the transmission capacity of networks. Furthermore, this study may provide novel insights into research on networked traffic systems.
| You currently do not have access to the full text article. |
|---|
