arXiv · 0711.1655
Congestion diffusion and decongestion strategy in networked traffic
Abstract
We study the information traffic in Barabási-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.
Explore related subjects
Keep this discovery
Zhi-Xi Wu, Wen-Xu Wang, Kai-Hau Yeung. 2007-11-11. Congestion diffusion and decongestion strategy in networked traffic. https://doi.org/10.1088/1367-2630%2F10%2F2%2F023025
Cite the original work for its findings. Save a collection to share your selection of sources.