—This short report first indicates a design flaw in the contention resolver unit proposed in  and then proposes an improved design which is simpler and faster.
—An optimized Ternary CAM concept is introduced for the hardware search engines in high-speed Internet routers. Our design employs + 1 RAM bits to store a word of size , whereas a conventional TCAM needs 2 RAM bits for the same word size. Based on this concept an 8-bit cluster is designed out of 9 SRAM bits, used as the basic building block of our… (More)
— Conventional routing cache systems store destination IP addresses in their cache directory. We present a routing cache technique that stores the most recently used route prefixes, instead of IP addresses, to achieve significantly smaller cache size. A nesting prefix is partially represented in this cache by its minimal expansions. Such expanded prefixes… (More)
–In this paper, we present an efficient IP packet forwarding methodology and architecture. This is achieved by partitioning the lookup table into the smaller ones for each output port and allowing a forwarding engine to process them in parallel. This effectively reduces the complexity of finding " the longest prefix match " problem to " the first prefix… (More)
We present a search algorithm implementable by a parallel architecture based on partitioned forwarding table. This scheme effectively reduces the complexity of finding "the longest prefix match" problem to "a prefix match" problem. The main feature of this algorithm is twofold. First, it advocates intelligent partitioning of the forwarding table to enhance… (More)
A novel low power ripple-precharge Ternary CAM (RP-TCAM) architecture is proposed for applications in longest prefix matching tasks. The main motivation behind this research is to reduce the dynamic power consumption in TCAM due to frequent charging and discharging of the highly capacitive match line. This issue is addressed by exploiting the fact that when… (More)