基于Trie的快速路由查找算法  

Fast Routing Lookup Algorithm Based on Trie

作　　者：王智强[1] 王振兴[1] 张定心[1] 

机构地区：[1]信息工程大学信息工程学院,河南郑州450002

出　　处：《信息工程大学学报》2003年第3期10-13,共4页Journal of Information Engineering University

摘　　要：随着互联网络光链路速率不断提高,路由查找已成为路由器报文转发的瓶颈。本文主要介绍近年来基于Trie的各种路由查找方法,同时对各种方法的性能进行了比较,最后介绍了一种性能优良的基于Trie的路由查找算法———压缩树算法。With the fast progress of the Internet,the optical line speed increases continually. Routing lookup has become the bottleneck of high speed packet forwarding.In this paper,various algorithms based on Trie and used in the last few years are proposed.The authors present a survey of those algorithms and compare them. Finally an algorithm based on Triecompressed Trie is introduced. 

关 键 词：路由查找算法 最长前缀匹配 TRIE 压缩树 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]