Traffic Dynamics Based on Local Routing Strategy in a Weighted Scale-Free Network

Abstract

In this paper, the traffic flow on weighted scale-free networks is investigated based on local routing strategy using link weights. The capacity of links is controlled by max(βwlj , 1). It is shown by simulations that two critical threshold βc1 and βc2 exist. When β > βc1, both the network capacity and the corresponding αc value remain unchanged. When βc1 > β > βc2, the network capacity decreases and the critical value of αc increases with the decrease of β. When β < βc2, αc decreases with the decrease of β. The behaviour can be explained by investigating the average number of packets on nodes and delivered through links.