IPv6 anycast address lookup using trier-based algorithm

As the Internet traffic increases, the size of route lookup tables in routers grew rapidly since the router has to route millions of IP packets per second. The current packet forwarding algorithms are designed specifically to route IPv4 packets. The lack of IPv4 addresses to support the vast growing Internet users and the increase in routing table size, have contributed to the birth of IPv6. IP version 6 (IPv6) is a new version of the Internet protocol designed as the successor to IP version 4 (IPv4). Various algorithms for high-performance IP address lookup have been proposed. In this paper, we propose possible designs for IPv6 anycast address lookup using trier tables and compare these designs in terms of lookup speed and storage requirements.