Study on the congestion in complex network based on traffic awareness algorithm
基于感知流量算法的复杂网络拥塞问题研究

We investigate the influence of complex network topological structure on the traffic delivery by the traffic awareness routing strategy. In order to characterize the efficiency of the packet delivery process, we introduce an order parameter to measure the network capacity by the critical value of phase transition from free flow to congestion. Here, we present two kinds of models, based on its degree or its betweenness that the delivery capacity of each node is proportional to. Simulation results show that, in the case of identical average degree, WS small-world network is significantly more susceptible to traffic congestion than ER random networks and BA scale-free networks in the first model, while the capacities of all kinds of networks are enhanced greatly in the second model, especially for WS small-world network. Finally, it is worth noting that which of the two models will be best suitable for handling traffic delivery depends on the structural characteristics of networks.