By Topic

A fast and updatable IP address lookup scheme

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

4 Author(s)
Sang-Hun Chung ; Dept. of Electr. Eng. & Comput. Sci., Korea Adv. Inst. of Sci. & Technol., Seoul, South Korea ; J. Sungkee ; Hyunsoo Yoon ; Jung-Wan Cho

The Internet is growing very rapidly in both the size and the amount of traffic. This growth has placed excessive strain on the Internet infrastructure, especially on routers. The IP address lookup is the operation that searches the longest matching prefix for the destination address of an incoming packet in order to determine the next hop of the packet. This operation is complex and is a major bottleneck in high-performance routers. In this paper, we propose a fast and updatable lookup scheme that can be easily implemented in hardware. We also present the memory allocation policy that supports for the incremental update of the forwarding table. Since our lookup scheme can be implemented with the small-bit logic and SRAM, the average delay per one lookup is about 18 ns. That is, our scheme can achieve 55.56 × 106 routing lookups/s in average

Published in:

Computer Networks and Mobile Computing, 2001. Proceedings. 2001 International Conference on

Date of Conference: