LOOKUP SOLUTIONS FOR GIGABIT SWITCH / ROUTER

The Internet continuous growth and its widespread applications require adequate solutions for scaling routing performance. A number of approaches have been recently proposed by different vendors to prepare for the next generation Internet, and new router architectures, capable of processing milli ons of packets per second, are starting to appear. The eff icient processing of IP addresses in such high performance internetworking equipment is one of the most challenging problems to solve. This paper focuses on the available technological solutions for the implementation of the address lookup unit in new generation IP switches and routers. Address lookup algorithms are discussed, and two fast, cheap and flexible hardware-assisted implementations are proposed and evaluated.

[1]  Gunnar Karlsson,et al.  Fast address look-up for internet routers , 1998, Broadband Communications.

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

[3]  Günter Karjoth,et al.  Routing on longest-matching prefixes , 1996, TNET.

[4]  Tong-Bi Pei,et al.  Putting Routing Tables in Silicon Moving routing tables from RAM to custom or semi-custom VLSI can lower cost and boost performance , 1992 .

[5]  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.

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

[7]  W. Richard Stevens,et al.  TCP/IP Illustrated, Volume 2: The Implementation , 1995 .

[8]  George Varghese,et al.  Faster IP lookups using controlled prefix expansion , 1998, SIGMETRICS '98/PERFORMANCE '98.