| Bellman-Ford算法的改进研究 |
| |
| 引用本文： | 陈华容,张崇富.Bellman-Ford算法的改进研究[J].电子科技大学学报（自然科学版）,2006,35(2):211-213. |
| |
| 作者姓名： | 陈华容 张崇富 |
| |
| 作者单位： | 1.西南科技大学计算机学院 四川 绵阳 621010; |
| |
| 摘 要： | 针对传统距离矢量路由(Bellman-Ford)算法,将多约束路由问题简化,并改进路由问题的限制条件,提出了改进的Bellman-Ford算法,应用于基于集中式控制路由协议网络模型。仿真结果表明,采用改进算法的网络路由计算时间随网络节点数有明显的改善,且网络阻塞率随路由请求数增加而下降。验证了改进算法比传统算法更加有效。
|
| 关 键 词： | 距离矢量路由 多约束路由 集中控制路由协议 时延-费用 阻塞率 |
| 收稿时间： | 2003-08-09 |
| 修稿时间： | 2003-08-09 |
Study on Amelioration of Bellman-Ford Algorithm |
| |
| CHEN Hua-rong,ZHANG Chong-fu.Study on Amelioration of Bellman-Ford Algorithm[J].Journal of University of Electronic Science and Technology of China,2006,35(2):211-213. |
| |
| Authors: | CHEN Hua-rong ZHANG Chong-fu |
| |
| Affiliation: | 1.College of Computer Science and Engineering,SWUST Sichuan Mianyang 621010;2.School of Communication and Information Engineering,UEST of China Chengdu 610054 |
| |
| Abstract: | Amelioration of Bellman-Ford algorithm is deduced in the letter based on traditional Bellman- Ford algorithm and applied to CCRP networks. The simulation results demonstrate that calculating time of networks adopted amelioration of Bellman-Ford algorithm is better than that of adopted Bellman-Ford algorithm with node number increasing and block ratio of networks is declining with request number increasing. |
| |
| Keywords: | Bellman-Ford multi-constrained problem central control routing protocol block ratio |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《电子科技大学学报（自然科学版）》浏览原始摘要信息 |
|
点击此处可从《电子科技大学学报（自然科学版）》下载全文 |
