A Scalable and Small Forwarding Table for Fast IP Address Lookups

Authors:
Sungkee Jean;Sang-Hung Chung;Jung-Wan Cho;Hyunsoo Yoon
Affiliations:
-;-;-;-
Venue:
ICCNMC '01 Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01)
Year:
2001

Citing 10
Cited 1

Routing on longest-matching prefixes

IEEE/ACM Transactions on Networking (TON)
Small forwarding tables for fast routing lookups

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Scalable high speed IP routing lookups

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Fast address lookups using controlled prefix expansion

ACM Transactions on Computer Systems (TOCS)
IP Routers: New Tool for Gigabit Networking

IEEE Internet Computing
Design of a Gigabit ATM Switch

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
IP switching and gigabit routers

IEEE Communications Magazine
On fast address-lookup algorithms

IEEE Journal on Selected Areas in Communications
IP-address lookup using LC-tries

IEEE Journal on Selected Areas in Communications
A novel IP-routing lookup scheme and hardware architecture for multigigabit switching routers

IEEE Journal on Selected Areas in Communications

A distributed architecture of the indirect IP lookup scheme for high-speed routers

PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

IP address lookup is an important design issue for the high performance Internet routers. The most important function of routers is to determine the output port of an incoming IP packet according to its destination address. In this paper, we propose a scalable and simple forwarding table structure for fast hardware-based IP address lookup which reduces memory requirements and memory access times. Proposed scheme requires maximum two memory access times in the worst case to finish an IP address lookup. And it consumes about 0.6 ¢ 1.1MBytes memory for large routing tables with 16,000 ¢ 43,000 routing prefixes whenany compression method is not used.