High-performance IP routing table lookup

Pi Chung Wang*, Chia Tai Chan, Yaw-Chung Chen

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


Nowadays, the commonly used table lookup scheme for IP routing is based on the so-called classless interdomain routing (CIDR). With CIDR, routers must find out the best matching prefix (BMP) for IP packets forwarding, which complicates the IP lookup. Currently, this process is mainly done in software and several schemes have been proposed for hardware implementation. Since the IP lookup performance is a major design issue for the new generation routers, in this article we propose a fast IP address lookup scheme, which significantly reduces the forwarding table to fit into SRAM with very low cost. It can also be implemented in hardware using the pipeline technique. By using our proposed method, the required memory space can be 90-170 Kb less than the previous scheme and three memory accesses for a lookup in the worst case. When implemented in hardware pipeline architecture, our mechanism can achieve one routing lookup per memory access.

Original languageEnglish
Pages (from-to)303-312
Number of pages10
JournalComputer Communications
Issue number3
StatePublished - 15 Feb 2002


  • Classless interdomain routing
  • IP routing
  • Pipeline technique

Fingerprint Dive into the research topics of 'High-performance IP routing table lookup'. Together they form a unique fingerprint.

Cite this