Study on the congestion in complex network based on traffic awareness algorithm

被引:19
|
作者
Wang Dan [1 ]
Yu Hao [1 ]
Jing Yuan-Wei [1 ]
Jiang Nan [1 ]
Zhang Si-Ying [1 ]
机构
[1] Northeastern Univ, Coll Informat Sci & Engn, Shenyang 110004, Peoples R China
基金
中国国家自然科学基金;
关键词
complex network; scale-free network; traffic awareness; congestion; SCALE-FREE NETWORKS; ROUTING STRATEGY; DYNAMICS; IMPACT;
D O I
10.7498/aps.58.6802
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
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.
引用
收藏
页码:6802 / 6808
页数:7
相关论文
共 25 条