| 一种应用于含权无标度网络的全局路由算法 |
| |
| 引用本文： | 濮存来,裴文江.一种应用于含权无标度网络的全局路由算法[J].物理学报,2010,59(6):3841-3845. |
| |
| 作者姓名： | 濮存来 裴文江 |
| |
| 作者单位： | 东南大学信息科学与工程学院，南京 210096 |
| |
| 基金项目： | 国家自然科学基金(批准号: 60672095, 60972165)、国家高技术研究发展计划(批准号:2007AA11Z210)和江苏省自然科学基金(批准号:BK2008281)资助的课题. |
| |
| 摘 要： | 针对含权无标度网络提出了一种全局路由算法.该算法利用网络路径上的节点强度信息构建了一种全局路由代价函数,选择使该代价函数最小的路径来传输信息包,有效避开了网络中易发生拥塞的核心节点.实验结果表明,与最短路径算法相比,该算法以较小的平均路径长度的增加为代价,将网络容量提高了十多倍.
|
| 关 键 词： | 含权无标度网络 路由 网络容量 节点强度 |
| 收稿时间： | 2009-08-25 |
A global routing method for weighted scale-free networks |
| |
| Pu Cun-Lai,Pei Wen-Jiang.A global routing method for weighted scale-free networks[J].Acta Physica Sinica,2010,59(6):3841-3845. |
| |
| Authors: | Pu Cun-Lai Pei Wen-Jiang |
| |
| Institution: | School of Information Science and Engineering, Southeast University, Nanjing 210096, China;School of Information Science and Engineering, Southeast University, Nanjing 210096, China |
| |
| Abstract: | In this article, a global routing method is proposed for weighted scale-free networks. To bypass the central nodes and alleviate the congestion, it chooses the best route according to the minimum value of the cost function which is based on the node strength. Simulation results show that the network capacity is improved more than 10 times by our method than by the shortest path strategy at the cost of a slightly growth in the average path-length. |
| |
| Keywords: | weighted scale-free network routing network capacity node strength |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《物理学报》浏览原始摘要信息 |
| 点击此处可从《物理学报》下载免费的PDF全文 |
|
