The bit-map trie for giga-bit forwarding lookup

This paper introduces a new data structure to perform forwarding lookups at giga-bit speed by condensing the forwarding table of backbone routers to fit into cache, eliminating slow memory accesses. The proposed structure bases on the conventional trie, which is good at partial string search. Each link in the proposed trie denotes some portion of IP address and a node also holds a pointer to a routing entry when the entry's destination is equal to the concatenation of IP prefixes assigned over the link path down to the node. For reduction of the trie's size, our trie encodes a set of child and routing entry pointers as a bit array where a single bit represents a pointer. So, we call this proposed structure bit-map trie. For better performance, the bit-map trie allows the lookup to directly start at the middle of the trie rather than always from the root node. The experiments show that the bitmap trie compacts backbone routers' tables small enough for 512Kbyte cache and accomplishes around 6 million lookups per second on Pentium II processor.