Abstract: A fast IPv6 lookup algorithm that hardware can be implemented is proposed, which takes advantage of segments of IPv6 address based on Content Addressable Memory（CAM） and utilizes pipeline to complete the design, can output the results of a lookup each cycle and needs tiny memory cost. The whole design has been tested on Xilinx Virtex-6 FPGA with 150×1024 IPv6 prefixes and the results of the test show that the maximum speed of lookup is 597 Mp/s （limited by internal access speed of RAM on chip）, the worst case of updating routing tables is 50 μs and the worst case of memory access number is 2. And the RAM and CAM resource needed by the design are 20.07 MB and 258 KB separately which is smaller than the similar algorithms.

Key words: IPv6 segment lookup, hardware implementation, Content Addressable Memory（CAM）

摘要： 提出一种可硬件实现的快速IPv6查找算法，采用基于内容可寻址存储器CAM的分段查找机制，用流水线实现，每个周期可输出一次查找结果，所需存储开销较小。在Xilinx Virtex-6 FPGA开发板用150×1 024项IPv6前缀测试表明，查找速度可达597 Mp/s（Million packet/s），最坏需要2次存储器访问，更新最坏需要50 μs，仅需20.07 MB的RAM和258 KB的CAM存储开销。

关键词: IPv6分段查找, 硬件实现, 内容可寻址存储器