| Generalized minimum information path routing strategy on scale-free networks |
| |
| 作者姓名： | 周思源 王开 张毅锋 裴文江 濮存来 李微 |
| |
| 作者单位： | School of Information Science and Engineering,Southeast University School of Computer Science and Engineering,Southeast University |
| |
| 基金项目： | 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), and 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.
|
| 关 键 词： | scale-free networks routing strategy minimum information path |
| 收稿时间： | 2010-12-13 |
Generalized minimum information path routing strategy on scale-free networks |
| |
| Zhou Si-Yuan,Wang Kai,Zhang Yi-Feng,Pei Wen-Jiang,Pu Cun-Lai and Li Wei.Generalized minimum information path routing strategy on scale-free networks[J].Chinese Physics B,2011,20(8):80501-080501. |
| |
| Authors: | Zhou Si-Yuan Wang Kai Zhang Yi-Feng Pei Wen-Jiang Pu Cun-Lai and Li Wei |
| |
| Institution: | School of Information Science and Engineering, Southeast University, Nanjing 210096, China;School of Information Science and Engineering, Southeast University, Nanjing 210096, China;School of Information Science and Engineering, Southeast University, Nanjing 210096, China;School of Information Science and Engineering, Southeast University, Nanjing 210096, China;School of Information Science and Engineering, Southeast University, Nanjing 210096, China;School of Computer Science and Engineering, Southeast University, Nanjing 210096, China |
| |
| Abstract: | 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. |
| |
| Keywords: | scale-free networks routing strategy minimum information path |
| 本文献已被 维普 等数据库收录！ |
| 点击此处可从《中国物理 B》浏览原始摘要信息 |
| 点击此处可从《中国物理 B》下载免费的PDF全文 |
|
