Title :
A trie-based algorithm for IP lookup problem
Author :
Yilmaz, Pinar Altin ; Belenkiy, Andrey ; Uzun, Necdet ; Gogate, Nitin ; Toy, Mehmet
Author_Institution :
New Jersey Inst. of Technol., Newark, NJ, USA
Abstract :
The increase in routing table sizes, number of updates, traffic, speed of links and migration to IPv6 have made IP address lookup, based on longest prefix matching, a major bottleneck for high performance routers. We evaluate and compare several schemes based on complexity analysis and simulation results. We present a trie based scheme, which we call linked list cascade addressable trie (LLCAT), which is easy to be implemented in hardware and allows routing table update operations to be performed incrementally requiring very few memory operations guaranteed for worst case to satisfy requirements of dynamic routing tables in high speed routers. We also consider compression schemes to be applied to our algorithm to improve memory consumption and search time
Keywords :
Internet; computational complexity; data compression; table lookup; telecommunication network routing; telecommunication traffic; transport protocols; IP address lookup; IPv6; Internet; complexity analysis; compression schemes; dynamic routing tables; high performance routers; high speed routers; link speed; linked list cascade addressable trie; longest prefix matching; memory consumption improvement; memory operations; routing table size; routing table updating; search time improvement; simulation results; traffic; trie-based algorithm; updates; Aggregates; Analytical models; Bandwidth; Hardware; Internet; Multimedia systems; Optical fiber networks; Routing; Telecommunication traffic; Traffic control;
Conference_Titel :
Global Telecommunications Conference, 2000. GLOBECOM '00. IEEE
Conference_Location :
San Francisco, CA
Print_ISBN :
0-7803-6451-1
DOI :
10.1109/GLOCOM.2000.892085
