A fast IP routing lookup scheme

A major issue in router design for the next generation Internet is the fast IP address lookup mechanism. The existing scheme by Huang et al. (see Proc. IEEE INFOCOM'99, New York, NY, 1999) performs the IP address lookup in hardware in which the forwarding table can be compressed to fit into a r...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters 2001-03, Vol.5 (3), p.125-127
Main Authors: WANG, Pi-Chung, CHAN, Chia-Tai, CHEN, Yaw-Chung
Format: Article
Language:English
Subjects:
Access methods and protocols, osi model
Applied sciences
Compressed
Costs
Exact sciences and technology
Hardware
Indexing
Internet
IP (Internet Protocol)
IP networks
Performance analysis
Pipeline processing
Random access memory
Routers
Routing
Spine
Static random access memory
Tables (data)
Telecommunications
Telecommunications and information theory
Teleprocessing networks. Isdn
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A major issue in router design for the next generation Internet is the fast IP address lookup mechanism. The existing scheme by Huang et al. (see Proc. IEEE INFOCOM'99, New York, NY, 1999) performs the IP address lookup in hardware in which the forwarding table can be compressed to fit into a reasonable-size SRAM, and a lookup can be accomplished in three memory accesses. We claim that with a little extra memory, it is able to further reduce the lookup time to two memory accesses.
ISSN:1089-7798
1558-2558
DOI:10.1109/4234.913161