Generalized minimum information path routing strategy on scale-free networks  

作　　者：周思源 王开 张毅锋 裴文江 濮存来 李微 

机构地区：[1]School of Information Science and Engineering,Southeast University [2]School of Computer Science and Engineering,Southeast University

出　　处：《Chinese Physics B》2011年第8期77-84,共8页中国物理B（英文版）

基　　金：Project supported by the National Natural Science Foundation of China (Grant No. 60972165);the National High Technology Project of China (Grant No. 2007AA11Z210);the Doctoral Fund of Ministry of Education of China (Grant Nos. 20100092120012,20070286004);the Foundation of High Technology Project in Jiangsu Province,the Natural Science Foundation of Jiangsu Province(Grant No. BK2010240);the Special Scientific Foundation for the"Eleventh-Five-Year" Plan of China

摘　　要：This paper presents a new routing strategy by introducing a tunable parameter into the minimum information path routing strategy we proposed previously. It is found that network transmission capacity can be considerably enhanced by adjusting the parameter with various allocations of node capability for packet delivery. Moreover, the proposed routing strategy provides a traffic load distribution which can better match the allocation of node capability than that of traditional efficient routing strategies, leading to a network with improved transmission performance. This routing strategy, without deviating from the shortest-path routing strategy in the length of paths too much, produces improved performance indexes such as critical generating rate, average length of paths and average search information.This paper presents a new routing strategy by introducing a tunable parameter into the minimum information path routing strategy we proposed previously. It is found that network transmission capacity can be considerably enhanced by adjusting the parameter with various allocations of node capability for packet delivery. Moreover, the proposed routing strategy provides a traffic load distribution which can better match the allocation of node capability than that of traditional efficient routing strategies, leading to a network with improved transmission performance. This routing strategy, without deviating from the shortest-path routing strategy in the length of paths too much, produces improved performance indexes such as critical generating rate, average length of paths and average search information.

关 键 词：scale-free networks routing strategy minimum information path 

分 类 号：O157.5[理学—数学] TP393.02[理学—基础数学]