Space Decomposition Techniques for Fast Layer-4 Switching

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:0b01b731d520b54916c95026e9beab8d

BUDDHIKOT, Milind M., Subhash SURI, Marcel WALDVOGEL, 2000. Space Decomposition Techniques for Fast Layer-4 Switching. In: TOUCH, Joseph D., ed., James P. G. STERBENZ, ed.. Protocols for High-Speed Networks VI. Boston, MA:Springer US, pp. 25-41. ISBN 978-1-4757-6318-8. Available under: doi: 10.1007/978-0-387-35580-1_4

@inproceedings{Buddhikot2000Space-6282, title={Space Decomposition Techniques for Fast Layer-4 Switching}, year={2000}, doi={10.1007/978-0-387-35580-1_4}, isbn={978-1-4757-6318-8}, address={Boston, MA}, publisher={Springer US}, booktitle={Protocols for High-Speed Networks VI}, pages={25--41}, editor={Touch, Joseph D. and Sterbenz, James P. G.}, author={Buddhikot, Milind M. and Suri, Subhash and Waldvogel, Marcel} }

<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/6282"> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:title>Space Decomposition Techniques for Fast Layer-4 Switching</dcterms:title> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6282/1/space_decomposition_techniques_for_fast_layer.pdf"/> <dc:format>application/pdf</dc:format> <dcterms:bibliographicCitation>First publ. as paper in: IFIP Sixth International Workshop on Protocols For High-Speed Networks (PfHSN '99), Salem, MA, August 1999, pp. 25-41</dcterms:bibliographicCitation> <dc:contributor>Suri, Subhash</dc:contributor> <dcterms:rights rdf:resource="https://creativecommons.org/licenses/by-nc-nd/2.0/legalcode"/> <dcterms:issued>2000</dcterms:issued> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:11:09Z</dc:date> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6282/1/space_decomposition_techniques_for_fast_layer.pdf"/> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:rights>deposit-license</dc:rights> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:11:09Z</dcterms:available> <dc:creator>Buddhikot, Milind M.</dc:creator> <dc:creator>Suri, Subhash</dc:creator> <dc:contributor>Waldvogel, Marcel</dc:contributor> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6282"/> <dcterms:abstract xml:lang="eng">Packet classification is the problem of matching each incoming packet at a router against a database of filters, which specify forwarding rules for the packets. The filters are a powerful and uniform way to implement new network services such as firewalls, Network Address Translation (NAT), Virtual Private Networks (VPN), and per-flow or class-based Quality of Service (QOS) guarantees. While several schemes have been proposed recently that can perform packet classification at high speeds, none of them achieves fast worst-case time for adding or deleting filters from the database. In this paper, we present a new scheme, based on space decomposition, whose search time is comparable to the best existing schemes, but which also offers fast worst-case filter update time. The three key ideas in this algorithm are as follows: (1) innovative data-structure based on quadtrees for a hierarchical representation of the recursively decomposed search space, (2) fractional cascading and precomputation to improve packet classification time, and (3) prefix partitioning to improve update time. Depending on the actual requirements of the system this algorithm is deployed in, a single parameter can be used to tradeoff search time for update time. Also, this algorithm is amenable to fast software and hardware implementation.</dcterms:abstract> <dc:creator>Waldvogel, Marcel</dc:creator> <dc:contributor>Buddhikot, Milind M.</dc:contributor> <dc:language>eng</dc:language> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

space_decomposition_techniques_for_fast_layer.pdf 197

Das Dokument erscheint in:

deposit-license Solange nicht anders angezeigt, wird die Lizenz wie folgt beschrieben: deposit-license

KOPS Suche


Stöbern

Mein Benutzerkonto