This HTML5 document contains 49 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n21http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n19http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216305%3A26230%2F14%3APU111984%21RIV15-MV0-26230___/
n20http://localhost/temp/predkladatel/
n15http://purl.org/net/nknouf/ns/bibtex#
n12http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n7http://linked.opendata.cz/resource/domain/vavai/projekt/
n8http://linked.opendata.cz/ontology/domain/vavai/
n17https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n6http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n14http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n16http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n22http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n13http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216305%3A26230%2F14%3APU111984%21RIV15-MV0-26230___
rdf:type
n8:Vysledek skos:Concept
dcterms:description
Rapidly growing speed and complexity of computer networks impose new requirements on fast lookup structures which are utilized in many networking applications (SDN, firewalls, NATs, etc.). We propose a novel lookup concept based on the well-known cuckoo hashing, which can achieve good memory utilization, supplemented by a binary search tree for offloading the colliding keys and supporting LPM lookup. We also propose a hardware architecture implementing this lookup concept in the FPGA. Our solution is suitable for lookup of the variable-length keys in 100+Gbps networks. Memory utilization of the proposed concept is thoroughly evaluated and it is shown that the concept is scalable to external memory components. Rapidly growing speed and complexity of computer networks impose new requirements on fast lookup structures which are utilized in many networking applications (SDN, firewalls, NATs, etc.). We propose a novel lookup concept based on the well-known cuckoo hashing, which can achieve good memory utilization, supplemented by a binary search tree for offloading the colliding keys and supporting LPM lookup. We also propose a hardware architecture implementing this lookup concept in the FPGA. Our solution is suitable for lookup of the variable-length keys in 100+Gbps networks. Memory utilization of the proposed concept is thoroughly evaluated and it is shown that the concept is scalable to external memory components.
dcterms:title
Fast Lookup for Dynamic Packet Filtering in FPGA Fast Lookup for Dynamic Packet Filtering in FPGA
skos:prefLabel
Fast Lookup for Dynamic Packet Filtering in FPGA Fast Lookup for Dynamic Packet Filtering in FPGA
skos:notation
RIV/00216305:26230/14:PU111984!RIV15-MV0-26230___
n3:aktivita
n4:S n4:P
n3:aktivity
P(ED1.1.00/02.0070), P(VG20102015022), S
n3:dodaniDat
n13:2015
n3:domaciTvurceVysledku
n12:4198727 Kekely, Lukáš n12:9452591 n12:9461728
n3:druhVysledku
n22:D
n3:duvernostUdaju
n11:S
n3:entitaPredkladatele
n19:predkladatel
n3:idSjednocenehoVysledku
16504
n3:idVysledku
RIV/00216305:26230/14:PU111984
n3:jazykVysledku
n16:eng
n3:klicovaSlova
Cuckoo hash, binary search, packet filtering, FPGA
n3:klicoveSlovo
n14:packet%20filtering n14:Cuckoo%20hash n14:binary%20search n14:FPGA
n3:kontrolniKodProRIV
[A997268A653E]
n3:mistoKonaniAkce
Warsaw
n3:mistoVydani
Warszawa
n3:nazevZdroje
17th IEEE Symposium on Design and Diagnostics of Electronic Circuits and Systems
n3:obor
n18:JC
n3:pocetDomacichTvurcuVysledku
4
n3:pocetTvurcuVysledku
4
n3:projekt
n7:VG20102015022 n7:ED1.1.00%2F02.0070
n3:rokUplatneniVysledku
n13:2014
n3:tvurceVysledku
Žádník, Martin Matoušek, Jiří Kekely, Lukáš Kořenek, Jan
n3:typAkce
n21:WRD
n3:zahajeniAkce
2014-04-23+02:00
s:numberOfPages
4
n6:doi
10.1109/DDECS.2014.6868793
n15:hasPublisher
IEEE Computer Society
n17:isbn
978-1-4799-4558-0
n20:organizacniJednotka
26230