Congestion diffusion and decongestion strategy in networked traffic

Details Congestion diffusion and decongestion strategy in networked traffic Congestion diffusion and decongestion strategy in networked traffic

2007-11-11

arxiv.org/abs/0711.1655v1

New Journal of Physics 10 (2008) 023025

Physics

Physics and Society

6 pages and 6 figures, all comments are welcome

Scientific paper

10.1088/1367-2630/10/2/023025

We study the information traffic in Barab\'asi-Albert scale free networks wherein each node has finite queue length to store the packets. It is found that in the case of shortest path routing strategy the networks undergo a first order phase transition i.e., from a free flow state to full congestion sate, with the increasing of the packet generation rate. We also incorporate random effect (namely random selection of a neighbor to deliver packets) as well as a control method (namely the packet-dropping strategy of the congested nodes after some delay time $T$) into the routing protocol to test the traffic capacity of the heterogeneous networks. It is shown that there exists optimal value of $T$ for the networks to achieve the best handling ability, and the presence of appropriate random effect also attributes to the performance of the networks.

Affiliated with

Also associated with

No associations

Rating

Congestion diffusion and decongestion strategy in networked traffic 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 Congestion diffusion and decongestion strategy in networked traffic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Congestion diffusion and decongestion strategy in networked traffic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-569603