Routing Based on Local Dynamic Queue Information
The efficiency of traffic routing on complex networks can be reflected by the network capacity. In this paper, a new routing strategy is proposed based local dynamic information for enhancing the efficiency of traffic on scale-free networks. The strategy is governed by a single parameter. Simulation results show that maximizing the network capacity can generate an optimal parameter value. The detailed analysis of the new strategy is provided for explaining its effects on traffic routing. The work indicates that the capacity of the system with packets distribution follows the Poisson distribution is larger than that with packets distribution displays the power law.
Scale-free Network Routing Strategy Congestion
Dan Wang Bo Zhang Yuanwei Jing Nan Jiang Siying Zhang
Institute of Information Science & Engineering, Northeastern University, Shenyang 110004, China Control Engineering, Academy of Armored Force Engineering, Beijing 100072, China
国际会议
2009年中国控制与决策会议(2009 Chinese Control and Decision Conference)
广西桂林
英文
4180-4183
2009-06-17(万方平台首次上网日期,不代表论文的发表时间)