Caching recently referenced IP addresses and their forwarding information is an effective strategy to increase routing lookup speed. This paper proposes a multizone non-blocking pipelined cache for IP routing lookup that achieves lower miss rates compared to previously reported IP caches. The twostage pipeline design provides a half-prefix half-full address cache and reduces the cache power con...

Increased bandwidth in the Internet puts great demands on network routers; for example, to route minimum sized Gigabit Ethernet packets, an IP router must process about packets per second per port. Using the “rule-of-thumb” that it takes roughly 1000 packets per second for every 106 bits per second of line rate, an OC-192 line requires routing lookups per second; well above current router capab...

Networks are expanding very fast and the number of clients is increasing dramatically, this causes the router forwarding table to become very large and present more demand on faster router operations. In this paper, we address the problem of packet forwarding in the routers aiming to increase the speed of address lookup and minimize the memory required for storing the forwarding table. We propo...

In modern IP routers, Internet Protocol (IP) lookup forms a bottleneck in packet forwarding because the lookup speed cannot catch up with the increase in link bandwidth. Ternary content-addressable memories (TCAMs) have emerged as viable devices for designing high-throughput forwarding engines on routers. Called ternary because they store don’t-care states in addition to 0s and 1s, TCAMs search...

We present an algorithmic framework for solving the packet classification problem that allows various access time vs. memory tradeoffs. It reduces the multi-dimensional packet classification problem to solving a few instances of the one-dimensional IP lookup problem. It gives the best known lookup performance with moderately large memory space. Furthermore, it efficiently supports a reasonable ...

Internet (IP) address lookup is a major bottleneck in high performance routers. IP address lookup is challenging because it requires a longest matching preex lookup. It is compounded by increasing routing table sizes, increased traac, higher speed links, and the migration to 128 bit IPv6 addresses. We describe how IP lookups and updates can be made faster using a set of transformation technique...

The design of lookup tables for fast IP address lookup algorithms using a general processor is formalized as an optimization problem. A cost model that models the access times and sizes of the hierarchical memory structure of the processor is formulated. Two algorithms, using dynamic programming and Lagrange multipliers, solve the optimization problem optimally and approximately respectively. E...

Internet routers conduct router-table lookup based on the destination IP address of the incoming packet to decide where to forward the packet. TCAM, which uses parallelism to achieve lookup in a single cycle, is a simple and efficient solution for router-table lookup. The major drawback of TCAM is its high power consumption. Trie based architecture proposed in. [1] can be used to reduce TCAM po...