Efficient IP routing table VLSI design for multigigabit routers

The routing table lookup becomes a great bottleneck when multi-gigabit links are required in today's network routers. Hence, we propose a lookup scheme that can efficiently handle IP routing lookup, insertion and deletion inside the routing table. By introducing memory reduction and the novel skip function, we have successfully reduced the required memory size to about 0.59 Mbytes. The routing table VLSI design was carried out. It can achieve one route lookup for every memory access using pipeline implementation. Timemill post-layout simulation results show that the chip can furnish approximately 30/spl times/10/sup 6/ lookups/s, and thus it can support up to 30 Gbits/s link speed when the frame size is 1000 bits. In addition, our design can be easily scaled from IPv4 to IPv6.

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

[2]  Chia-Tai Chan,et al.  A fast IP routing lookup scheme , 2001, IEEE Commun. Lett..

[3]  Farnam Jahanian,et al.  Internet routing instability , 1997, SIGCOMM '97.

[4]  V. Srinivasan,et al.  Fast address lookups using controlled prefix expansion , 1999, TOCS.

[5]  Paul Francis,et al.  Fast routing table lookup using CAMs , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[6]  C. Zukowski,et al.  Putting routing tables in silicon , 1992, IEEE Network.

[7]  Jin-Soo Kim,et al.  Scalable IP lookup scheme with small forwarding table for gigabit routers , 2002 .

[8]  Butler W. Lampson,et al.  IP lookups using multiway and multicolumn search , 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.

[9]  Gunnar Karlsson,et al.  IP-address lookup using LC-tries , 1999, IEEE J. Sel. Areas Commun..

[10]  George Varghese,et al.  Efficient fair queueing using deficit round robin , 1995, SIGCOMM '95.

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

[12]  Ramesh Govindan,et al.  BGP Route Flap Damping , 1998, RFC.

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

[14]  Srinivasan Keshav,et al.  Issues and trends in router design , 1998, IEEE Commun. Mag..

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

[16]  Minoru Togashi,et al.  Asynchronous transfer mode switching LSI chips with 10-Gb/s serial I/O ports , 1995 .

[17]  David Waitzman,et al.  A 50-Gb/s IP router , 1998, TNET.

[18]  Henry H.-Y. Tzeng,et al.  On fast address-lookup algorithms , 1999, IEEE J. Sel. Areas Commun..

[19]  Fred Baker,et al.  Requirements for IP Version 4 Routers , 1995, RFC.

[20]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[21]  Vince Fuller,et al.  Classless Inter-Domain Routing (CIDR): an Address Assignment and Aggregation Strategy , 1993, RFC.

[22]  Nen-Fu Huang,et al.  A novel IP-routing lookup scheme and hardware architecture for multigigabit switching routers , 1999, IEEE J. Sel. Areas Commun..