中国物理B ›› 2013, Vol. 22 ›› Issue (6): 68901-068901.doi: 10.1088/1674-1056/22/6/068901

• INTERDISCIPLINARY PHYSICS AND RELATED AREAS OF SCIENCE AND TECHNOLOGY • 上一篇    

Analysis of network traffic flow dynamics based on gravitational field theory

刘刚, 李永树, 张喜平   

  1. Faculty of Geosciences and Environmental Engineering, Southwest JiaoTong University, Chengdu 610031, China
  • 收稿日期:2012-09-05 修回日期:2012-12-06 出版日期:2013-05-01 发布日期:2013-05-01
  • 基金资助:
    Project supported by the Specialized Research Fund for the Doctoral Program of Higher Education of China (Grant No. 20100184110019), the 2013 Cultivation Project of Excellent Doctorate Dissertation of Southwest Jiaotong University, the 2013 Doctoral Innovation Funds of Southwest Jiaotong University, the Natural Science Research Program of Chongqing Educational Committee, China (Grant No. KJ120528), China Postdoctoral Science Foundation (Grant No. 2011M501412), the National Natural Science Foundation of China (Grant No. 41201475/D0108), and the Fundamental Research Funds for the Central Universities, China (Grant No. A0920502051208-16).

Analysis of network traffic flow dynamics based on gravitational field theory

Liu Gang (刘刚), Li Yong-Shu (李永树), Zhang Xi-Ping (张喜平)   

  1. Faculty of Geosciences and Environmental Engineering, Southwest JiaoTong University, Chengdu 610031, China
  • Received:2012-09-05 Revised:2012-12-06 Online:2013-05-01 Published:2013-05-01
  • Contact: Liu Gang E-mail:liuganggis@sina.com
  • Supported by:
    Project supported by the Specialized Research Fund for the Doctoral Program of Higher Education of China (Grant No. 20100184110019), the 2013 Cultivation Project of Excellent Doctorate Dissertation of Southwest Jiaotong University, the 2013 Doctoral Innovation Funds of Southwest Jiaotong University, the Natural Science Research Program of Chongqing Educational Committee, China (Grant No. KJ120528), China Postdoctoral Science Foundation (Grant No. 2011M501412), the National Natural Science Foundation of China (Grant No. 41201475/D0108), and the Fundamental Research Funds for the Central Universities, China (Grant No. A0920502051208-16).

PDF (PC)

649

赞

摘要： For further research on the gravity mechanism of routing protocol on complex networks, we introduce the concept of routing awareness depth, represented with ρ . On this basis, we define the calculating formula of the gravity of the transmission route for the packet, and propose a routing strategy based on gravitational field of node and routing awareness depth. In order to characterize the efficiency of the method, we introduce an order parameter η to measure the throughput of the network by the critical value of phase transition from free flow to congestion, and use the node betweenness centrality B to test the transmission efficiency of the network and congestion distribution. We simulate the network transmission performance under different values of routing awareness depth ρ . Simulation results show that if the value of routing awareness depth ρ is too small, the gravity of the route is composed of the attraction of very few nodes on the route, which cannot improve the capacity of the network effectively; if the value of routing awareness depth ρ is greater than the network's average distance <l>, the capacity of the network may be improved greatly and no longer change with the sustainable increment of routing awareness depth ρ , the performance of the routing strategy enters into a constant state; moreover, whatever the value of routing awareness depth ρ is, our algorithm always effectively balances the distribution of betweenness centrality and realizes the equal distribution of network load.

关键词: routing strategy, congestion, gravitation field, complex networks

Abstract: For further research on the gravity mechanism of routing protocol on complex networks, we introduce the concept of routing awareness depth, represented with ρ . On this basis, we define the calculating formula of the gravity of the transmission route for the packet, and propose a routing strategy based on gravitational field of node and routing awareness depth. In order to characterize the efficiency of the method, we introduce an order parameter η to measure the throughput of the network by the critical value of phase transition from free flow to congestion, and use the node betweenness centrality B to test the transmission efficiency of the network and congestion distribution. We simulate the network transmission performance under different values of routing awareness depth ρ . Simulation results show that if the value of routing awareness depth ρ is too small, the gravity of the route is composed of the attraction of very few nodes on the route, which cannot improve the capacity of the network effectively; if the value of routing awareness depth ρ is greater than the network's average distance <l>, the capacity of the network may be improved greatly and no longer change with the sustainable increment of routing awareness depth ρ , the performance of the routing strategy enters into a constant state; moreover, whatever the value of routing awareness depth ρ is, our algorithm always effectively balances the distribution of betweenness centrality and realizes the equal distribution of network load.

Key words: routing strategy, congestion, gravitation field, complex networks

中图分类号:  (Networks and genealogical trees)

  • 89.75.Hc
89.20.Hh (World Wide Web, Internet)