Article ID Journal Published Year Pages File Type
977545 Physica A: Statistical Mechanics and its Applications 2006 8 Pages PDF
Abstract

By incorporating local traffic information into the basic shortest path routing policy, we propose a congestion awareness routing strategy with a tunable parameter. We investigate the effectiveness of the proposed routing strategy for scale-free networks with different clustering coefficients and in different congestion phases. We find that there exists an optimal value for the tunable parameter in the congestion awareness strategy. Though the optimal value increases slowly as the traffic in the network becomes heavier, it is almost independent of the clustering property of the scale-free network. Furthermore, the performance upgradation of the new routing strategy compared with the basic shortest path routing policy becomes more significant as the network becomes more clustered.

Related Topics
Physical Sciences and Engineering Mathematics Mathematical Physics
Authors
, ,