Study of dynamic and static routing for improvement of the transportation efficiency on small complex networks
arXiv:1208.1401 · doi:10.1016/j.physa.2013.01.033
Abstract
In this paper, we are exploring strategies for the reduction of the congestion in the complex networks. The nodes without buffers are considered, so, if the congestion occurs, the information packets will be dropped. The focus is on the efficient routing. The routing strategies are compared using two generic models, i.e., Barabàsi-Albert scale-free network and scale-free network on lattice, and the academic router networks of the Netherlands and France. We propose a dynamic deflection routing algorithm which automatically extends path of the packet before it arrives at congested node. The simulation results indicate that the dynamic routing strategy can further reduce number of dropped packets in a combination with the efficient path routing proposed by Yan et al. [Phys. Rev. E 73, 046108 (2006)].
References in corpus (7)
- Efficient routing on complex networks
- Dynamics of jamming transitions in complex networks
- Optimal routing on complex networks
- Integrating static and dynamic information for routing traffic
- Resource allocation pattern in infrastructure networks
- Efficient routing strategies in scale-free networks with limited bandwidth
- Fluctuation-driven capacity distribution in complex networks