No abstract

Abstract-With the development of IPv6 networks, IP address lookup has been the bottleneck for high performance routers. In this paper, a two-level IPv6 lookup algorithm based on Hash and CAM is proposed on an analysis on the prefix length distribution of routing table and the growth trend of routing table entries. The prefixes whose length can be divided by 8 are stored in seven Hash RAMs in first level, the remaining prefixes, with their length cannot be divided by 8, will be stored into expanded RAMs in second level. Our proposed scheme was implemented with 8-stage pipeline design and was verified on Xilinx V6-board. The experiments show that the algorithm has high efficient storage utilization, searching rate and updating rate. Furthermore, it is easy to be scalded in hardware.