Fast address lookup for Internet routers

Fast address lookup for Internet routers (1998)

by Stefan Nilsson , Gunnar Karlsson

Venue:	IEEE Broadband Communications
Citations:	74 - 4 self

Datum	Value	Source
TITLE	Fast address lookup for Internet routers	SVM HeaderParse 0.2
AUTHOR NAME	Stefan Nilsson	SVM HeaderParse 0.2
AUTHOR AFFIL	Helsinki University of Technology	SVM HeaderParse 0.2
AUTHOR ADDR	P.O. Box 1100, FIN-02015 HUT,	SVM HeaderParse 0.2
AUTHOR NAME	Gunnar Karlsson	SVM HeaderParse 0.2
AUTHOR AFFIL	Swedish Institute of Computer Science	SVM HeaderParse 0.2
AUTHOR ADDR	P.O. Box 1263, SE-164 29 Kista,	SVM HeaderParse 0.2
ABSTRACT	We consider the problem of organizing address tables for internet routers to enable fast searching. Our proposal is to to build an efficient, compact and easily searchable implementation of an IP routing table by using an LC-trie, a trie structure with combined path and level compression. The depth of this structure increases very slowly as function of the number of entries in the table. A node can be coded in only four bytes and the size of the main search structure never exceeds 256 kB for the tables in the US core routers. We present a software implementation that can sustain approximately half a million lookups per second on a 133 MHz Pentium personal computer, and two million lookups per second on a more powerful SUN Sparc Ultra II workstation. 1	SVM HeaderParse 0.2
YEAR	1998	INFERENCE
VENUE	IEEE Broadband Communications	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	11--22	INFERENCE
CITATIONS	17 found	ParsCit 1.0