Efficient routing on scale-free networks based on local information

Details Efficient routing on scale-free networks based on local information Efficient routing on scale-free networks based on local information

2005-06-28

arxiv.org/abs/physics/0506204v1

Physics Letters A 351, 220-224(2006)

Physics

Physics and Society

4 pages, 7 figures

Scientific paper

10.1016/j.physleta.2005.10.104

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.

Affiliated with

Also associated with

No associations

Rating

Efficient routing on scale-free networks based on local information does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient routing on scale-free networks based on local information, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient routing on scale-free networks based on local information will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-434667