Novel IP address lookup algorithm for inexpensive hardware implementation

Kari Seppänen

Novel IP address lookup algorithm for inexpensive hardware implementation

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

Abstract

The key factor defining the efficiency of IP routers is the speed of the forwarding operation, that is the speed of determining the next-hop destination for each packet. The operation is notsimple because the IP addresses are unstructured and the destination subnetworks can be overlapping. This requires so called longest match lookup operation. In this paper I propose a simple and very fast address lookup algorithm that can be easily implemented in hardware. It is designed for inexpensive systems and thus requires only standard SRAM and FPGA devices. However, its performance exceeds even the requirements of today's backbone routers and it allows for incremental forwarding table updates.

Original language	English
Title of host publication	Proceedings of the 6th WSEAS International Multiconference on Circuits, Systems,Communications and Computers, CSCC 2002
Publisher	World Scientific and Engineering Academy and Society, WSEAS
Pages	3371 - 3379
ISBN (Print)	960-8052-63-7
Publication status	Published - 2002
MoE publication type	Not Eligible
Event	6th WSEAS World multiconference on circuits, systems, communications and computers - Rethymno, Greece Duration: 7 Jul 2002 → 14 Jul 2002

Conference

Conference	6th WSEAS World multiconference on circuits, systems, communications and computers
Country/Territory	Greece
City	Rethymno
Period	7/07/02 → 14/07/02

Cite this

@inproceedings{51f924cde005455bba9b4ea3eeb7744d,

title = "Novel IP address lookup algorithm for inexpensive hardware implementation",

abstract = "The key factor defining the efficiency of IP routers is the speed of the forwarding operation, that is the speed of determining the next-hop destination for each packet. The operation is notsimple because the IP addresses are unstructured and the destination subnetworks can be overlapping. This requires so called longest match lookup operation. In this paper I propose a simple and very fast address lookup algorithm that can be easily implemented in hardware. It is designed for inexpensive systems and thus requires only standard SRAM and FPGA devices. However, its performance exceeds even the requirements of today's backbone routers and it allows for incremental forwarding table updates.",

author = "Kari Sepp{\"a}nen",

note = "Project code: T1SU00011; 6th WSEAS World multiconference on circuits, systems, communications and computers ; Conference date: 07-07-2002 Through 14-07-2002",

year = "2002",

language = "English",

isbn = "960-8052-63-7",

pages = "3371 -- 3379",

booktitle = "Proceedings of the 6th WSEAS International Multiconference on Circuits, Systems,Communications and Computers, CSCC 2002",

publisher = "World Scientific and Engineering Academy and Society, WSEAS",

address = "United States",

}

Seppänen, K 2002, Novel IP address lookup algorithm for inexpensive hardware implementation. in Proceedings of the 6th WSEAS International Multiconference on Circuits, Systems,Communications and Computers, CSCC 2002. World Scientific and Engineering Academy and Society, WSEAS, pp. 3371 - 3379, 6th WSEAS World multiconference on circuits, systems, communications and computers, Rethymno, Greece, 7/07/02.

Novel IP address lookup algorithm for inexpensive hardware implementation. / Seppänen, Kari.
Proceedings of the 6th WSEAS International Multiconference on Circuits, Systems,Communications and Computers, CSCC 2002. World Scientific and Engineering Academy and Society, WSEAS, 2002. p. 3371 - 3379.

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

TY - GEN

T1 - Novel IP address lookup algorithm for inexpensive hardware implementation

AU - Seppänen, Kari

N1 - Project code: T1SU00011

PY - 2002

Y1 - 2002

N2 - The key factor defining the efficiency of IP routers is the speed of the forwarding operation, that is the speed of determining the next-hop destination for each packet. The operation is notsimple because the IP addresses are unstructured and the destination subnetworks can be overlapping. This requires so called longest match lookup operation. In this paper I propose a simple and very fast address lookup algorithm that can be easily implemented in hardware. It is designed for inexpensive systems and thus requires only standard SRAM and FPGA devices. However, its performance exceeds even the requirements of today's backbone routers and it allows for incremental forwarding table updates.

AB - The key factor defining the efficiency of IP routers is the speed of the forwarding operation, that is the speed of determining the next-hop destination for each packet. The operation is notsimple because the IP addresses are unstructured and the destination subnetworks can be overlapping. This requires so called longest match lookup operation. In this paper I propose a simple and very fast address lookup algorithm that can be easily implemented in hardware. It is designed for inexpensive systems and thus requires only standard SRAM and FPGA devices. However, its performance exceeds even the requirements of today's backbone routers and it allows for incremental forwarding table updates.

M3 - Conference article in proceedings

SN - 960-8052-63-7

SP - 3371

EP - 3379

BT - Proceedings of the 6th WSEAS International Multiconference on Circuits, Systems,Communications and Computers, CSCC 2002

PB - World Scientific and Engineering Academy and Society, WSEAS

T2 - 6th WSEAS World multiconference on circuits, systems, communications and computers

Y2 - 7 July 2002 through 14 July 2002

ER -

Novel IP address lookup algorithm for inexpensive hardware implementation

Abstract

Conference

Fingerprint

Cite this