Many IP address lookup schemes have been researched that generally fall into either of two categories: trie-based and TCAM-based.
In this paper, we propose a new novel IP address lookup architecture which especially focuses on memory efficiency and fast updatability.
In that scheme, leaf-pushed unibit trie is used for IP address lookup. They tried to optimize memory balancing which is crucial in the pipelined architecture.
IP address lookup can be performed very fast irrespective of the length of the matched prefix since it is always completed by accesses to TCAM and SRAM.
TCAM-based IP address lookup engine can find the longest matching prefix with one access using parallel search, however, its power consumption and cost have been the problems.
There have been many researches on exploiting the caching mechanism to speed up IP address lookup. Those caches can be classified into a few techniques: IP address caching, prefix caching, multi-zone caching, and short-cut caching.
Dai, "An Active Routing Prefix Caching Algorithm for IP Address Lookup," in Proc.
Biersack, and Walid Dabbous, "Survey and taxonomy of IP address lookup algorithms", IEEE Network, vol.