一种基于分段压缩的IPv6路由查找算法  

A fast IPv6 route lookup algorithm with compressed trie

作　　者：姚兴苗[1] 李乐民[1] 胡光岷[1] 

机构地区：[1]电子科技大学宽带光纤传输与通信系统技术重点实验室,四川成都610054

出　　处：《通信学报》2004年第10期51-57,共7页Journal on Communications

摘　　要：提出了一种基于分段压缩的快速 IPv6 路由查找算法。与文献中的 LLCAT 算法相比,该算法节省了存储空间,当某扩展节点的表项所对应的前缀数量小于预先设定的值时,前缀不再扩展而使用压缩算法。同时,最坏情况下算法的查找时间和更新复杂度基本没有改变。仿真试验结果表明:算法的平均查找时间和消耗的存储器容量都优于 LLCAT 算法。To solve the problem of LLCAT algorithm that needs large memory space for IPv6 route lookup, A fast IPv6 route lookup algorithm with compressed trie was proposed. In order to save space, compressed algorithm was used when a node’s table includes some prefixes that were less than or equal to a pre-defined value. After being compressed, the algorithm’s time and update complexity do not change much under the worst condition. Simulation results show that our average searching time and memory consumed are efficient to those of LLCAT algorithm.

关 键 词：IPV6路由查找 分段压缩 扩展前缀 

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