| 路由查找算法的性能分析与研究 |
| |
| 引用本文： | 王希,戴靓婕.路由查找算法的性能分析与研究[J].科技广场,2006(11):17-19. |
| |
| 作者姓名： | 王希 戴靓婕 |
| |
| 作者单位： | 南昌教育学院信息工程系,南昌,330006 |
| |
| 摘 要： | 本文介绍了当前几种路由查找算法,并对这几种路由查找算法的复杂度和实际运行性能进行了分析研究。研究表明,虽然二分查找算法在查找性能上没有很大提高,但是在IPv6环境中由于多分支Tire树的查找性能将会有很大的降低,因而二分查找算法的优越性将会得到充分体现。
|
| 关 键 词： | 互联网 多分支Trie树 前缀扩展 步宽 哈希表 |
| 文章编号： | 1671-4792-（2006）11-0058-03 |
Routing Algorithm Performance Analysis |
| |
| Wang Xi,Dai Liangjie.Routing Algorithm Performance Analysis[J].Science Mosaic,2006(11):17-19. |
| |
| Authors: | Wang Xi Dai Liangjie |
| |
| Institution: | Information Engineering Department, Nanchang Education Institute, Nanchang 330006 |
| |
| Abstract: | This paper introduced several current Routing Algorithms and analyzed their complexity and actual performance.The research indicated that:although binary search doesn't improve much on the performance,its superiority will be obvious in IPv6 environment because Multi-branch Trie tree's search performance will reduce a lot in that situation,So the binary search will be more and more be prefered. |
| |
| Keywords: | Internet Multi-branch Trie Tree Prefix Expansion Step Width Hash Table |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
