This paper proposes a power and time efficient scheme for designing IP lookup tables. The proposed scheme uses partitioned Ternary Content Addressable Memories (TCAMs) that store IP lookup tables. The proposed scheme enables O(1) time penalty for updating an IP lookup table. The partitioned TCAMs allow an update done by a simple insertion without the need for routing table sorting. The organiza...

IP address lookup is an important function to meet such requirements as high speed, memory size and low power for the overall performance of the routers. The biggest problem of IP address lookup is that prefixes has a variable length so that longest prefix match should be employed for IP address lookup. Binary search is useful to decrease search times. But binary search is only adaptable to an ...

As network speeds continue to grow, current methods of translating destination IP addresses to output port numbers during routing become inadequately slow. Eventhough this lookup is often performed in hardware, it may still be limited by DRAM access latencies. We present a method of speeding up access to DRAM based lookup mechanisms by more than a factor of 10 using CPU style memory caches. Rea...

IP address lookup is to determine the next hop destination o f an incoming packet in the router. The address lookup is a major bottleneck in high performance router due to the increased routing table sizes, increased traffic, higher speed links, and the migration to 128 bits IPv6 addresses. IP lookup time is dependent on data structure of lookup table and search scheme. In this paper, we propos...

Routers can use packet classification to support advanced functions such as QoS routing, virtual private networks and access control. Unlike traditional routers, which forward packets based on destination address only, routers with packet classification capability can forward packets based on multiple header fields, such as source address, protocol type, or application port numbers. The destina...

High performance Internet routers require an efficient IP lookup algorithm to forward millions of packets per second. Various binary trie data structures are normally used in software-based routers. Binary trie based lookup algorithms are simple not only for searching for the longest prefix match but also for updating the routing table. In this paper, we propose a new IP lookup algorithm based ...

For meeting the requirements of the high-speed Internet and satisfying the Internet users, building fast routers with high-speed IP address lookup engine is inevitable. Regarding the unpredictable variations occurred in the forwarding information during the time and space, the IP lookup algorithm should be able to customize itself with temporal and spatial conditions. This paper proposes a new ...