Fast IP routing lookups for high performance routers

Authors:
T. Kijkanjanarat;H. J. Chao
Affiliations:
Department of Electrical Engineering, Polytechnic University, 6 Metrotech Center, Brooklyn, NY 11201, USA;Department of Electrical Engineering, Polytechnic University, 6 Metrotech Center, Brooklyn, NY 11201, USA
Venue:
Computer Communications
Year:
1999

Citing 6
Cited 0

Routing on longest-matching prefixes

IEEE/ACM Transactions on Networking (TON)
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
Scalable high speed IP routing lookups

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

SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
A Trie Compaction Algorithm for a Large Set of Keys

IEEE Transactions on Knowledge and Data Engineering
Fast address look-up for internet routers

BC '98 Proceedings of the IFIP TC6/WG6.2 Fourth International Conference on Broadband Communications: The future of telecommunications

Quantified Score

Hi-index	0.24

Visualization

Abstract

The key to the success of the next generation IP networks to provide good services relies on the deployment of high performance routers to do fast IP routing lookups. In this paper, we propose a new algorithm for fast IP lookups using a so-called two-trie structure. The two-trie structure provides the advantages in that less memory space is required for representing a routing table than the standard trie while it still provides fast IP lookups. Based on the simulation result, the memory space can be saved around 27% over the standard trie while a lookup operation takes 1.6 memory accesses in the average case and 8 memory accesses in the worst case. Also, the structure is not based on any assumptions about the distribution of the prefix lengths in routing tables. Thus, increasing the lengths from 32 to 128bit (from IPv4 to IPv6) does not affect the main structure.