By Topic

A high-speed IP routing lookup scheme with fast updates

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
$31 $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)
Byung-Yeob Kim ; Dept. of Comput. Eng., Hongik Univ., Seoul, South Korea ; Yoon-Hwa Choi

Most of the existing IP address lookup schemes emphasize the table lookups with little attention to table updates. Updating the routing table often requires a considerable time overhead, especially for gigabit backbone routers. This paper presents a high-speed lookup scheme with a small bounded update time for IP forwarding engines in IP routers. It achieves one IP address lookup per memory access by employing memory access pipelining and updates the table in the time bounded by the IP packet interarrival time on a gigabit link, regardless of the size of the database. The resulting design requires manageably small memories to be implemented using current SRAM technology.

Published in:

High Speed Networks and Multimedia Communications 5th IEEE International Conference on

Date of Conference:

2002