A fast IP routing lookup scheme

A major issue in router design for the next generation Internet is the fast IP address lookup mechanism. The existing scheme by Huang et al. (see Proc. IEEE INFOCOM'99, New York, NY, 1999) performs the IP address lookup in hardware in which the forwarding table can be compressed to fit into a reasonable-size SRAM, and a lookup can be accomplished in three memory accesses. We claim that with a little extra memory, it is able to further reduce the lookup time to two memory accesses.

[1]  Bernhard Plattner,et al.  Scalable high speed IP routing lookups , 1997, SIGCOMM '97.

[2]  Nick McKeown,et al.  Routing lookups in hardware at memory access speeds , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[3]  Svante Carlsson,et al.  Small forwarding tables for fast routing lookups , 1997, SIGCOMM '97.

[4]  Yakov Rekhter,et al.  An Architecture for IP Address Allocation with CIDR , 1993, RFC.