| IPv4下路由查表及算法分析 |
| |
| 引用本文： | 肖宇,兰巨龙,廖鹰,胡艳.IPv4下路由查表及算法分析[J].计算机工程与应用,2004,40(15):131-136,229. |
| |
| 作者姓名： | 肖宇 兰巨龙 廖鹰 胡艳 |
| |
| 作者单位： | 国家数字交换系统工程技术研究中心NDSC,郑州,450002 |
| |
| 基金项目： | 国家863高技术研究发展计划重大课题“高性能IPv6路由器基础平台及实验系统”(编号:2001AA121011) |
| |
| 摘 要： | 查找路由表以给出下一跳地址是路由器中分组转发的核心步骤,因此快速的路由查表算法是实现高速分组转发的关键。该文分析了IPv4下路由查表问题及其难点,详细介绍了现有的各种查找算法并对它们进行了分析和比较,给出了在不同情况下应用适当查表算法的结论。
|
| 关 键 词： | 转发 路由查表 最长前缀匹配 Trie树 |
| 文章编号： | 1002-8331-(2004)15-0131-06 |
IPv4 Routing Lookup and Analysis of its Algorithms |
| |
| Xiao Yu,Lan Julong Liao Ying Hu,Yan.IPv4 Routing Lookup and Analysis of its Algorithms[J].Computer Engineering and Applications,2004,40(15):131-136,229. |
| |
| Authors: | Xiao Yu Lan Julong Liao Ying Hu Yan |
| |
| Abstract: | Routing lookup plays a key part of packet forwarding,so fast IP address lookup algorithm is the significant part of high speed packet forwarding.This paper analyzes the difficulty of routing lookup and presents a survey of various kinds of lookup algorithms and compare s them in details.In the end,the conclusion of applying different lookup algorithms under different circumstance is put forward. |
| |
| Keywords: | forwarding routing lookup longest prefix matching Trie tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
