Efficient routing on scale-free networks based on local information

Abstract

In this letter, we propose a new routing strategy with a single free parameter $\alpha$ only based on local information of network topology. In order to maximize the packets handling capacity of underlying structure that can be measured by the critical point of continuous phase transition from free flow to congestion, the optimal value of $\alpha$ is sought out. By investigating the distributions of queue length on each node in free state, we give an explanation why the delivering capacity of the network can be enhanced by choosing the optimal $\alpha$. Furthermore, dynamic properties right after the critical point are also studied. Interestingly, it is found that although the system enters the congestion state, it still possesses partial delivering capability which do not depend on $\alpha$. This phenomenon suggests that the capacity of the network can be enhanced by increasing the forwarding ability of small important nodes which bear severe congestion.

4 pages, 7 figures

References in corpus (12)

• Maximal planar networks with large clustering coefficient and power-law degree distribution
• Traffic on complex networks: Towards understanding global statistical properties from microscopic density fluctuations
• Sandpile on Scale-Free Networks
• General Dynamics of Topology and Traffic on Weighted Technological Networks
• Epidemic spread in weighted scale-free networks
• Congestion and decongestion in a communication network
• A Mutual Selection Model for Weighted Networks
• Perturbation: the Catastrophe Causer in Scale-Free Networks
• Scaling in directed dynamical small-world networks with random responses
• Temporal Series Analysis Approach to Spectra of Complex Networks
• Self-organized Boolean game on networks
• Random Walks on Complex Networks

Cited by in corpus (19)

• Efficient routing on complex networks
• Behaviors of susceptible-infected epidemics on scale-free networks with identical infectivity
• Power-law Strength-Degree Correlation From a Resource-Allocation Dynamics on Weighted Networks
• Congestion phenomena on complex networks
• A spectrum of routing strategies for brain networks
• Traffic congestion in interconnected complex networks
• Relations between Average Distance, Heterogeneity and Network Synchronizability
• Efficient routing strategies in scale-free networks with limited bandwidth
• Traffic dynamics in scale-free networks with limited packet-delivering capacity
• Better Synchronizability Predicted by Crossed Double Cycle
• Better synchronizability predicted by a new coupling method
• The synchronizability of highly clustered scale-free networks
• A minimal model for congestion phenomena on complex networks
• Scaling behavior of an artificial traffic model on scale-free networks
• Self Avoiding Paths Routing Algorithm in Scale-Free Networks
• Boolean Game on Scale-free Networks
• Immunization for complex network based on the effective degree of vertex
• Study of dynamic and static routing for improvement of the transportation efficiency on small complex networks
• Weighted Shortest Path Models: A Revisit to the Simulation of Internet Routing