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

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

Namespace Prefixes

PrefixIRI
n7http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n22http://purl.org/net/nknouf/ns/bibtex#
n19http://localhost/temp/predkladatel/
n16http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n9http://linked.opendata.cz/resource/domain/vavai/subjekt/
n8http://linked.opendata.cz/ontology/domain/vavai/
n18http://linked.opendata.cz/resource/domain/vavai/zamer/
n14https://schema.org/
shttp://schema.org/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/
skoshttp://www.w3.org/2004/02/skos/core#
n21http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216305%3A26230%2F11%3APU96039%21RIV12-MSM-26230___/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n6http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n17http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n10http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216305%3A26230%2F11%3APU96039%21RIV12-MSM-26230___
rdf:type
n8:Vysledek skos:Concept
dcterms:description
This paper introduces new longest prefix match algorithm Hash-Tree Bitmap suitable for IPv6 look-up. While most of the existing LPM algorithms focus on high density IPv4 prefix tables, the proposed algorithm is well suited for combination of both sparse and dense areas, which is typical for IPv6 rule sets. The Hash-Tree Bitmap algorithm use efficient and fast hash look-up for sparse areas and Tree Bitmap algorithm for high density trie areas. The proposed algorithm was mapped to the hardware architecture and implemented as a pipeline of processing elements. The resulting hardware architecture offers well balanced resource requirements and is able to achieve the wire-speed throughput for 100 Gbps networks. This paper introduces new longest prefix match algorithm Hash-Tree Bitmap suitable for IPv6 look-up. While most of the existing LPM algorithms focus on high density IPv4 prefix tables, the proposed algorithm is well suited for combination of both sparse and dense areas, which is typical for IPv6 rule sets. The Hash-Tree Bitmap algorithm use efficient and fast hash look-up for sparse areas and Tree Bitmap algorithm for high density trie areas. The proposed algorithm was mapped to the hardware architecture and implemented as a pipeline of processing elements. The resulting hardware architecture offers well balanced resource requirements and is able to achieve the wire-speed throughput for 100 Gbps networks.
dcterms:title
Effective Hash-based IPv6 Longest Prefix Match Effective Hash-based IPv6 Longest Prefix Match
skos:prefLabel
Effective Hash-based IPv6 Longest Prefix Match Effective Hash-based IPv6 Longest Prefix Match
skos:notation
RIV/00216305:26230/11:PU96039!RIV12-MSM-26230___
n8:predkladatel
n9:orjk%3A26230
n5:aktivita
n12:Z
n5:aktivity
Z(MSM0021630528)
n5:dodaniDat
n10:2012
n5:domaciTvurceVysledku
n16:9452591 n16:5518288
n5:druhVysledku
n20:D
n5:duvernostUdaju
n11:S
n5:entitaPredkladatele
n21:predkladatel
n5:idSjednocenehoVysledku
196575
n5:idVysledku
RIV/00216305:26230/11:PU96039
n5:jazykVysledku
n17:eng
n5:klicovaSlova
longest prefix match, IP look-up, IPv6, FPGA
n5:klicoveSlovo
n6:FPGA n6:longest%20prefix%20match n6:IPv6 n6:IP%20look-up
n5:kontrolniKodProRIV
[C971BD7D5061]
n5:mistoKonaniAkce
Cottbus
n5:mistoVydani
Cottbus
n5:nazevZdroje
IEEE Design and Diagnostics of Electronic Circuits and Systems DDECS'2011
n5:obor
n15:JC
n5:pocetDomacichTvurcuVysledku
2
n5:pocetTvurcuVysledku
2
n5:rokUplatneniVysledku
n10:2011
n5:tvurceVysledku
Kořenek, Jan Tobola, Jiří
n5:typAkce
n7:WRD
n5:zahajeniAkce
2011-04-13+02:00
n5:zamer
n18:MSM0021630528
s:numberOfPages
4
n22:hasPublisher
IEEE Computer Society
n14:isbn
978-1-4244-9753-9
n19:organizacniJednotka
26230