@inproceedings{donnelly2000ip,
author = {Donnelly, Austin and Deegan, Tim},
title = {IP Route Lookups as String Matching},
organization = {IEEE},
booktitle = {IEEE LCN'2000},
year = {2000},
month = {November},
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.},
url = {http://approjects.co.za/?big=en-us/research/publication/ip-route-lookups-as-string-matching/},
pages = {589-595},
}