Survey and taxonomy of IP address lookup algorithms |
| |
Authors: | Ruiz-Sanchez M.A. Biersack E.W. Dabbous W. |
| |
Affiliation: | Dept. of Comput. Sci., INRIA, Sophia Antipolis ; |
| |
Abstract: | Due to the rapid growth of traffic in the Internet, backbone links of several gigabits per second are commonly deployed. To handle gigabit-per-second traffic rates, the backbone routers must be able to forward millions of packets per second on each of their ports. Fast IP address lookup in the routers, which uses the packet's destination address to determine for each packet the next hop, is therefore crucial to achieve the packet forwarding rates required. IP address lookup is difficult because it requires a longest matching prefix search. In the last couple of years, various algorithms for high-performance IP address lookup have been proposed. We present a survey of state-of-the-art IP address lookup algorithms and compare their performance in terms of lookup speed, scalability, and update overhead |
| |
Keywords: | |
|
|