IP route lookups as string matching

Authors:
A. Donnelly;T. Deegan
Affiliations:
-;-
Venue:
LCN '00 Proceedings of the 25th Annual IEEE Conference on Local Computer Networks
Year:
2000

Citing 0
Cited 7

A simple and scalable algorithm for the IP address lookup problem

Fundamenta Informaticae - Special issue on computing patterns in strings
Scalable, memory efficient, high-speed IP lookup algorithms

IEEE/ACM Transactions on Networking (TON)
LZ trie and dictionary compression

Software—Practice & Experience
A scalable IPv6 route lookup scheme via dynamic variable-stride bitmap compression and path compression

Computer Communications
You can get there from here: routing in the internet

CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
A pipelined processor architecture for regular expression string matching

Microprocessors & Microsystems
A Simple and Scalable Algorithm for the IP Address Lookup Problem

Fundamenta Informaticae - Computing Patterns in Strings

Quantified Score

Hi-index	0.00

Visualization

Abstract

An IP route lookup can be considered as a string matching problem on the destination address. Finite state automata (FSA) are a flexible and efficient way to match strings. This paper describes how a routing table can be encoded as an FSA and how, through a process of state reduction, we can obtain an optimal representation. This gives insights into the basic properties of the longest-prefix match problem.