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.

6 pages and 6 figures, all comments are welcome

References in corpus (27)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• The structure and function of complex networks
• Error and attack tolerance of complex networks
• Epidemic spreading in scale-free networks
• Epidemic dynamics and endemic states in complex networks
• Heterogeneity in oscillator networks: Are smaller worlds easier to synchronize?
• Efficient routing on complex networks
• Optimal network topologies for local search with congestion
• Communication in networks with hierarchical branching
• Fluctuations in network dynamics
• Improved routing strategies for Internet traffic delivery
• Dynamics of jamming transitions in complex networks
• Optimal routing on complex networks
• Integrating static and dynamic information for routing traffic
• Critical load and congestion instabilities in scale-free networks
• Dynamical properties of model communication networks
• Application of Statistical Physics to Politics
• Communication Bottlenecks in Scale-Free Networks
• Transport optimization on complex networks
• Effect of congestion costs on shortest paths through complex networks
• Congestion and decongestion in a communication network
• Interplay between function and structure in complex networks
• Large Scale Cross-Correlations in Internet Traffic
• Communication and optimal hierarchical networks
• Search in Complex Networks : a New Method of Naming
• Growing dynamics of Internet providers

Cited by in corpus (7)

• The Large Scale Curvature of Networks
• Locating the source of diffusion in complex networks by time-reversal backward spreading
• Efficient routing strategies in scale-free networks with limited bandwidth
• Traffic dynamics in scale-free networks with limited packet-delivering capacity
• Comprehensive routing strategy on multilayer networks
• Immunization of traffic-driven epidemic spreading
• Traffic-driven epidemic spreading on scale-free networks with tunable degree distribution