Scalable High-Speed Prefix Matching

Cite This

Files in this item

Checksum: MD5:dec86689ea739f0ba5b76101d942d2f1

WALDVOGEL, Marcel, George VARGHESE, Jon TURNER, Bernhard PLATTNER, 2001. Scalable High-Speed Prefix Matching. In: ACM Transactions on Computer Systems. 19(4), pp. 440-482. Available under: doi: 10.1145/502912.502914

@article{Waldvogel2001Scala-6031, title={Scalable High-Speed Prefix Matching}, year={2001}, doi={10.1145/502912.502914}, number={4}, volume={19}, journal={ACM Transactions on Computer Systems}, pages={440--482}, author={Waldvogel, Marcel and Varghese, George and Turner, Jon and Plattner, Bernhard} }

<rdf:RDF xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <dc:creator>Plattner, Bernhard</dc:creator> <dcterms:hasPart rdf:resource=""/> <dc:creator>Waldvogel, Marcel</dc:creator> <dc:format>application/pdf</dc:format> <dc:contributor>Turner, Jon</dc:contributor> <dc:rights>terms-of-use</dc:rights> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <bibo:uri rdf:resource=""/> <dspace:hasBitstream rdf:resource=""/> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:contributor>Plattner, Bernhard</dc:contributor> <dcterms:bibliographicCitation>First publ. in: ACM Transactions on Computer Systems, 19 (2001), 4, pp. 440-482</dcterms:bibliographicCitation> <dcterms:title>Scalable High-Speed Prefix Matching</dcterms:title> <dc:contributor>Waldvogel, Marcel</dc:contributor> <dcterms:abstract xml:lang="eng">Finding the longest matching prefix from a database of keywords is an old problem with a number of applications, ranging from dictionary searches to advanced memory management to computational geometry. But perhaps today's most frequent best matching prefix lookups occur in the Internet, when forwarding packets from router to router. Internet traffic volume and link speeds are rapidly increasing; at the same time, a growing user population is increasing the size of routing tables against which packets must be matched. Both factors make router prefix matching extremely performance critical.In this paper, we introduce a taxonomy for prefix matching technologies, which we use as a basis for describing, categorizing, and comparing existing approaches. We then present in detail a fast scheme using binary search over hash tables, which is especially suited for matching long addresses, such as the 128 bit addresses proposed for use in the next generation Internet Protocol, IPv6. We also present optimizations that exploit the structure of existing databases to further improve access time and reduce storage space.</dcterms:abstract> <dcterms:rights rdf:resource=""/> <dcterms:isPartOf rdf:resource=""/> <dspace:isPartOfCollection rdf:resource=""/> <dcterms:issued>2001</dcterms:issued> <dc:date rdf:datatype="">2011-03-24T16:08:51Z</dc:date> <dc:language>deu</dc:language> <dc:creator>Varghese, George</dc:creator> <dc:contributor>Varghese, George</dc:contributor> <dcterms:available rdf:datatype="">2011-03-24T16:08:51Z</dcterms:available> <dc:creator>Turner, Jon</dc:creator> </rdf:Description> </rdf:RDF>

Downloads since Oct 1, 2014 (Information about access statistics)

waldvogel01scalable.pdf 602

This item appears in the following Collection(s)

Search KOPS


My Account