By Topic

Efficient IP routing table VLSI design for multigigabit routers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
R. C. Chang ; Dept. of Electr. Eng., Nat. Chung Hsing Univ., Taichung, Taiwan ; B. -H. Lim

In this paper, an Internet Protocol (IP) forwarding table very large-scale integration design is presented. The table lookup becomes a great bottleneck when multigigabit links are required in today's network routers. Hence, we present a lookup scheme that can efficiently handle IP routing lookup, insertion, and deletion inside the forwarding table. By introducing memory reduction and the novel skip function, we have successfully reduced the required memory size to about 0.59 MB. The forwarding table hardware design was carried out using Verilog hardware description language. 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×106 lookups/s, and thus it can support up to 30 Gbits/s link speed. In addition, our design can be easily scaled from IPv4 to IPv6.

Published in:

IEEE Transactions on Circuits and Systems I: Regular Papers  (Volume:51 ,  Issue: 4 )