IP Route Lookup Design

IP ROUTE LOOKUPS 368

13.1.2 IP Route Lookup Design

When designing the data structure used in the forwarding table, the primary goal is to minimize lookup time. To reach that goal, two parameters should be simultaneously minimized: 䢇 the number of memory accesses required during lookups, and 䢇 the size of the data structure. Reducing the number of memory accesses required during a lookup is important because memory accesses are relatively slow and usually the bottleneck of lookup procedures. If the data structure can be made small enough, it can fit entirely in the cache of a conventional microprocessor. This means that memory accesses will be orders of magnitude faster than if the data structure needs to reside in memory consisting of the relatively slow DRAM. If the forwarding table does not fit entirely in the cache, it is still beneficial if a large fraction of the table can reside in cache. Locality in traffic patterns will keep the most frequently used pieces of the data structure in cache, so that most lookups will be fast. Moreover, it becomes feasible to use fast SRAM for the small amount of needed external memory. SRAM is expensive, and the faster it is, the more expensive it is. For a given cost, the SRAM can be faster if less is needed. As secondary design goals, the data structure should 䢇 need few instructions during lookup, and 䢇 keep the entities naturally aligned as much as possible to avoid expen- sive instructions and cumbersome bit-extraction operations. These goals have a second-order effect on the performance of the data structure. For the purpose of understanding the data structure, imagine a binary tree Ž . that spans the entire IP address space Fig. 13.3 . Its height is 32, and the number of its leaves is 2 32 , one for each possible IP address. The prefix of a routing table entry defines a path in the tree ending in some node. All IP Fig. 13.3 Binary tree spanning the entrie IP address space. IP ROUTE LOOKUP BASED ON STANDARD TRIE STRUCTURE 369 Fig. 13.4 Routing entries defining ranges of IP addresses. Ž . addresses leaves in the subtree rooted at that node should be routed according to that routing entry. In this manner each routing table entry Ž defines a range of IP addresses with identical routing information next-hop . IP address . If several routing entries cover the same IP address, the rule of the longest match is applied; it states that for a given IP address, the routing entry with the longest matching prefix should be used. This situation is illustrated in Figure 13.4; the routing entry e1 is hidden by e2 for addresses in the range r.

13.2 IP ROUTE LOOKUP BASED ON CACHING TECHNIQUE