Integrating static and dynamic information for routing traffic

Abstract

The efficiency of traffic routing on complex networks can be reflected by two key measurements i.e. the system capacity and the average data packets travel time. 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 there exists a optimal parameter value by considering both maximizing the network capacity and reducing the packet travel time. Comparing with the strategy by 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. This work suggests that how to effectively utilize the larger degree nodes plays the key role in the scale-free traffic systems.

5 pages, 5 figures

References in corpus (3)

• Efficient routing on complex networks
• Sandpile on Scale-Free Networks
• Congestion and decongestion in a communication network

Cited by in corpus (5)

• Self-similarity, small-world, scale-free scaling, disassortativity, and robustness in hierarchical lattices
• Congestion diffusion and decongestion strategy in networked traffic
• The effect of bandwidth in scale-free network traffic
• Preferential Behaviour and Scaling in Diffusive Dynamics on Networks
• Traffic dynamics of packets generated with non-homogeneously selected sources and destinations in scale-free networks