Implementation of a Parallel-Search Trie-based Scheme for Fast IP Lookup

R. Rojas-Cessa, L. Ramesh, Z. Dong, B. D'Alessandro, and N. Ansari


Trie search, parallel search, prefix expansion, hashing, RAM based.


The Internet Protocol (IP) address lookup is required to be resolved fast to keep up with data rate increases. To cope with the increasing number of entries, solutions for IP lookup based on random access memory (RAM), which store prefixes in a trie-based structure, are of interest. In this paper, we propose a flexible and fast trie-based IP lookup algorithm where parallel searching is performed. This algorithm performs lookup in a maximum of two memory-access times while using a feasible amount of memory.

Important Links:

Go Back