Implementation of a parallel-search trie-based scheme for fast IP lookup

Authors:
Roberto Rojas-Cessa;Laksmi Ramesh;Ziqian Dong;Brian D'Alessandro;Nirwan Ansari
Affiliations:
New Jersey Institute of Technology;New Jersey Institute of Technology;New Jersey Institute of Technology;New Jersey Institute of Technology;New Jersey Institute of Technology
Venue:
CSNA '07 Proceedings of the IASTED International Conference on Communication Systems, Networks, and Applications
Year:
2007

Citing 4
Cited 0

Small forwarding tables for fast routing lookups

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Fast address lookups using controlled prefix expansion

ACM Transactions on Computer Systems (TOCS)
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric

Journal of the ACM (JACM)
Scalable IP lookup for Internet routers

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.