Multi-dimensional Prefix Matching Using Line Search


Dateien zu dieser Ressource

Prüfsumme: MD5:a56f1643861b5d122c485ecc7f0c745c

WALDVOGEL, Marcel, 2000. Multi-dimensional Prefix Matching Using Line Search. 25th Annual IEEE Conference on Local Computer Networks. LCN 2000. Tampa, FL, USA. In: Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000. IEEE Comput. Soc, pp. 200-207. ISBN 0-7695-0912-6. Available under: doi: 10.1109/LCN.2000.891028

@inproceedings{Waldvogel2000Multi-6278, title={Multi-dimensional Prefix Matching Using Line Search}, year={2000}, doi={10.1109/LCN.2000.891028}, isbn={0-7695-0912-6}, publisher={IEEE Comput. Soc}, booktitle={Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000}, pages={200--207}, author={Waldvogel, Marcel} }

<rdf:RDF xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:available rdf:datatype="">2011-03-24T16:10:42Z</dcterms:available> <dc:rights>terms-of-use</dc:rights> <dc:date rdf:datatype="">2011-03-24T16:10:42Z</dc:date> <dc:format>application/pdf</dc:format> <dc:creator>Waldvogel, Marcel</dc:creator> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <bibo:uri rdf:resource=""/> <dcterms:bibliographicCitation>First publ. in: Proceedings / 25th Annual IEEE Conference on Local Computer Networks (LCN 2000), Tampa, Florida, USA, 2000, pp. 200-207</dcterms:bibliographicCitation> <dc:language>eng</dc:language> <dcterms:title>Multi-dimensional Prefix Matching Using Line Search</dcterms:title> <dcterms:hasPart rdf:resource=""/> <dspace:hasBitstream rdf:resource=""/> <dc:contributor>Waldvogel, Marcel</dc:contributor> <dcterms:isPartOf rdf:resource=""/> <dcterms:abstract xml:lang="eng">With the increasing popularity of firewalls, virtual private networks (VPNs) and Quality of Service (QoS) routing, packet classification becomes increasingly important in the Internet. The high-performance solutions known so far strongly rely on certain properties of the filter database to match against, such as a small number of distinct prefixes or the absence of conflicts. In this paper, we present Line Search as a two-dimensional generalization of the one-dimensional binary search on prefix lengths, exploiting the advantage given by the different approach therein. This algorithm also works best on the filter databases that are expected to occur most often, but degrades gracefully when these assumptions no longer hold. We also show how to efficiently extend the algorithm to a complete five-dimensional Internet Protocol (IP) and transport header match.</dcterms:abstract> <dcterms:rights rdf:resource=""/> <dcterms:issued>2000</dcterms:issued> <dspace:isPartOfCollection rdf:resource=""/> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

multidimensional_prefix_matching_using.pdf 91

Das Dokument erscheint in:

terms-of-use Solange nicht anders angezeigt, wird die Lizenz wie folgt beschrieben: terms-of-use

KOPS Suche


Mein Benutzerkonto