ADDRESS RESOLUTION ENGINE TO SEARCH BOTH IPV4 AND IPV6 ADDRESSES

摘要

The fast resolution technique for IP route is very important in the Internet. Several hardware based techniques have been studied so far, but almost all methods were specific for the IPv4 address. In case of migrating from IPv4 to IPv6 or of controlling IP flows to achieve QoS, an address resolution engine is required to handle variable address lengths. This paper presents a new binary tree algorithm capable of searchig both IPv4 and IPv6. This binary tree is coposed of nodes whose prefix length is only one byte. The circuit using this algorithm achieves above 1 Mpps throughput in average for 128k entries of IPv6 addresses with a small size of FPGA(several kGates)and a small amount of SRAM (256k x 36bit)