Traffic resource allocation for complex networks  

作　　者：凌翔 胡茂彬 龙建成 丁建勋 石琴 

机构地区：[1]School of Transportation Engineering, Hefei University of Technology [2]School of Engineering Science, University of Science and Technology of China

出　　处：《Chinese Physics B》2013年第1期583-588,共6页中国物理B（英文版）

基　　金：Project supported by the National Basic Research Program of China (Grant No. 2012CB725404);the National Natural Science Foundation of China(Grant Nos. 71071044, 71171185, 71201041, 71271075, and 11247291/A05);the Doctoral Program of the Ministry of Education of China (Grant No. 20110111120023)

摘　　要：In this paper, an optimal resource allocation strategy is proposed to enhance traffic dynamics in complex networks. The network resources are the total node packet-delivering capacity and the total link bandwidth. An analytical method is developed to estimate the overall network capacity by using the concept of efficient betweenness （ratio of algorithmic betweenness and local processing capacity）. Three network structures （scale-free, small-world, and random networks） and two typical routing protocols （shortest path protocol and efficient routing protocol） are adopted to demonstrate the performance of the proposed strategy. Our results show that the network capacity is reversely proportional to the average path length for a particular routing protocol and the shortest path protocol can achieve the largest network capacity when the proposed resource allocation strategy is adopted.In this paper, an optimal resource allocation strategy is proposed to enhance traffic dynamics in complex networks. The network resources are the total node packet-delivering capacity and the total link bandwidth. An analytical method is developed to estimate the overall network capacity by using the concept of efficient betweenness （ratio of algorithmic betweenness and local processing capacity）. Three network structures （scale-free, small-world, and random networks） and two typical routing protocols （shortest path protocol and efficient routing protocol） are adopted to demonstrate the performance of the proposed strategy. Our results show that the network capacity is reversely proportional to the average path length for a particular routing protocol and the shortest path protocol can achieve the largest network capacity when the proposed resource allocation strategy is adopted.

关 键 词：complex network shortest path protocol efficient routing protocol resource allocation strategy 

分 类 号：U491[交通运输工程—交通运输规划与管理] O157.5[交通运输工程—道路与铁道工程]