Integrating local static and dynamic information for routing traffic

The efficiency of traffic routing on complex networks can be reflected by two key measurements, i.e., the network capacity and the average travel time of data packets. In this paper we propose a mixing routing strategy by integrating local static and dynamic information for enhancing the efficiency of traffic on scale-free networks. The strategy is governed by a single parameter. Simulation results show that maximizing the network capacity and reducing the packet travel time can generate an optimal parameter value. Compared with the strategy of adopting exclusive local static information, the new strategy shows its advantages in improving the efficiency of the system. The detailed analysis of the mixing strategy is provided for explaining its effects on traffic routing. The work indicates that effectively utilizing the larger degree nodes plays a key role in scale-free traffic systems.