Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
975099 | Physica A: Statistical Mechanics and its Applications | 2008 | 7 Pages |
Abstract
By incorporating local traffic information into the shortest path routing strategy, we numerically investigate the effectiveness of the traffic awareness routing strategy for scale-free networks with different clustering. In order to characterize the efficiency of the packet-delivery process, we introduce an order parameter and an average transmission time that allow us to measure the network capacity by the critical value of phase transition from free flow to congestion. Compared with the shortest path routing protocol, the network capacity is greatly enhanced by the traffic awareness routing strategy. We also find that there exists an optimum value for the tunable parameter in the congestion awareness strategy. Moreover, simulation results show that the more clustered the network, the less efficient the packet-delivery process.
Related Topics
Physical Sciences and Engineering
Mathematics
Mathematical Physics
Authors
Dan Wang, Yuanwei Jing, Siying Zhang,