DocumentCode :
1459153
Title :
Survey and taxonomy of IP address lookup algorithms
Author :
Ruiz-Sánchez, Miguel A. ; Biersack, Ernst W. ; Dabbous, Walid
Author_Institution :
Dept. of Comput. Sci., INRIA, Sophia Antipolis, France
Volume :
15
Issue :
2
fYear :
2001
Firstpage :
8
Lastpage :
23
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 :
search problems; table lookup; telecommunication network routing; telecommunication traffic; transport protocols; IP address lookup algorithms; backbone links; backbone routers; longest matching prefix search; lookup speed; packet destination address; packet forwarding rates; performance; scalability; survey; traffic; traffic rates; update overhead; Aggregates; Explosions; Internet; Routing; Scalability; Spine; Taxonomy; Topology;
fLanguage :
English
Journal_Title :
Network, IEEE
Publisher :
ieee
ISSN :
0890-8044
Type :
jour
DOI :
10.1109/65.912716
Filename :
912716
Link To Document :
بازگشت