Effect of Adaptive Delivery Capacity on Networked Traffic Dynamics  

作　　者：CAO Xian-Bin DU Wen-Bo CHEN Cai-Long ZHANG Jun 曹先彬;杜文博;陈才龙;张军(School of Electronic and Information Engineering,Beihang University,Beijing 100083;School of Computer Science and Technology,University of Science and Technology of China,Hefei 230026)

机构地区：[1]School of Electronic and Information Engineering,Beihang University,Beijing 100083 [2]School of Computer Science and Technology,University of Science and Technology of China,Hefei 230026

出　　处：《Chinese Physics Letters》2011年第5期278-281,共4页中国物理快报（英文版）

基　　金：Supported by the National Basic Research Program of China(No 2011CB707004);the Foundation for Innovative Research Groups of the National Natural Science Foundation of China(No 60921001);Program for New Century Excellent Talents in University(NCET-07-0787)。

摘　　要：We introduce an adaptive delivering capacity mechanism into the traffic dynamic model on scale-free networks under shortest path routing strategy and focus on its effect on the network capacity measured by the critical point(R_(c))of phase transition from free flow to congestion.Under this mechanism,the total node's delivering capacity is fixed and the allocation of delivering capacity on node i is proportional to niφ,where ni is the queue length of node i andφis the adjustable parameter.It is found that the network capacity monotonously increases with the increment ofφ,but there exists an optimal value of parameterφleading to the highest transportation efficiency measured by average travelling time(〈T〉).Our work may be helpful for optimal design of networked traffic dynamics.

关 键 词：NETWORK OPTIMAL MECHANISM 

分 类 号：TN9[电子电信—信息与通信工程]