Hybrid routing on scale-free networks

We propose a novel routing algorithm to optimize traffic performance on complex networks. It combines static structural properties and dynamic traffic conditions together and therefore can balance the traffic between hubs and peripheral nodes more effectively. Simulation results show that the network capacity can be enhanced considerably, and the average traveling time is also shortened sharply, compared with the other two recently-proposed routing algorithms. The effect of the timescale over which the routing information is updated is also investigated. Moreover, a counter-intuitive and beneficial phenomenon about the average traveling time emerges when the packet generation rate is relatively high.