Packet Forwarding using Efficient Hash Tables

Zink, Thomas; Waldvogel, Marcel

Packet Forwarding using Efficient Hash Tables

Dateien

eht.pdfGröße: 1.6 MBDownloads: 109

Datum

2009

Projekt

High-Speed Router Functions

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Sonstiges, textgebunden (z.B. Gutachten, Blogbeiträge)

Publikationsstatus

Published

Zusammenfassung

This report discusses our proposed improvements to Fast Hash Ta- bles (FHT) which we name 'Efficient Hash Table' (EHT) where 'efficient' relates to both memory efficiency and lookup performance. The mecha- nism we use to design the EHT lead to improvements in terms of sram memory requirements by the factor of ten over the FHT. Our results back the theoretical analysis and allow accurate predictions. A cost function is provided that allows the adjustment of EHT parameter to different user requirements.

Fachgebiet (DDC)

004 Informatik

Schlagwörter

hash table, router, ip lookup, bloom filter

Zitieren

ISO 690

ZINK, Thomas, Marcel WALDVOGEL, 2009. Packet Forwarding using Efficient Hash Tables

BibTex

@misc{Zink2009Packe-17600,
  year={2009},
  title={Packet Forwarding using Efficient Hash Tables},
  author={Zink, Thomas and Waldvogel, Marcel}
}

RDF

<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/server/rdf/resource/123456789/17600">
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/17600/2/eht.pdf"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2012-03-22T09:38:17Z</dc:date>
    <dcterms:title>Packet Forwarding using Efficient Hash Tables</dcterms:title>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:rights>terms-of-use</dc:rights>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Waldvogel, Marcel</dc:contributor>
    <dcterms:abstract xml:lang="eng">This report discusses our proposed improvements to Fast Hash Ta- bles (FHT) which we name 'Efficient Hash Table' (EHT) where 'efficient' relates to both memory efficiency and lookup performance. The mecha- nism we use to design the EHT lead to improvements in terms of sram memory requirements by the factor of ten over the FHT. Our results back the theoretical analysis and allow accurate predictions. A cost function is provided that allows the adjustment of EHT parameter to different user requirements.</dcterms:abstract>
    <dcterms:issued>2009</dcterms:issued>
    <dc:creator>Waldvogel, Marcel</dc:creator>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2012-03-22T09:38:17Z</dcterms:available>
    <dc:creator>Zink, Thomas</dc:creator>
    <dc:contributor>Zink, Thomas</dc:contributor>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/17600/2/eht.pdf"/>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/17600"/>
    <dc:language>eng</dc:language>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Ja