Pipelined architecture for fast IP lookup

Abstract

Abstrucf-EP lookup is a key step in IP processing and many algorithms have been proposed The challenges are speed, fast table updates, cost and power consumption. In this paper, we propose a RAM-based architecture for i P lookup. The design requirements are the following: one memory access per lookup, reasonable amount of memory requirement, and fast table updates. We show the design and its performance in the paper.