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

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

Namespace Prefixes

PrefixIRI
n15http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n7http://purl.org/net/nknouf/ns/bibtex#
n23http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n6http://linked.opendata.cz/resource/domain/vavai/projekt/
n19http://linked.opendata.cz/resource/domain/vavai/subjekt/
n18http://linked.opendata.cz/ontology/domain/vavai/
n21https://schema.org/
n22http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F63839172%3A_____%2F13%3A10130212%21RIV14-TA0-63839172/
n10http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n11http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n16http://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/obor/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n9http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F63839172%3A_____%2F13%3A10130212%21RIV14-TA0-63839172
rdf:type
skos:Concept n18:Vysledek
dcterms:description
The increasing number of devices connected to the Internet together with video on demand have a direct impact to the speed of network links and performance of core routers. To achieve 100 Gbps throughput, core routers have to implement IP lookup in dedicated hardware and represent a forwarding table using a data structure, which fits into the onchip memory. Current IP lookup algorithms have high memory demands when representing IPv6 prefix sets or introduce very high pre-processing overhead. Therefore, we performed analysis of IPv4 and IPv6 prefixes in forwarding tables and propose a novel memory representation of IP prefix sets, which has very low memory demands. The proposed representation has better memory utilization in comparison to the highly optimized Shape Shifting Trie (SST) algorithm and it is also suitable for IP lookup in 100 Gbps networks, which is shown on a new pipelined hardware architecture with 170 Gbps throughput. The increasing number of devices connected to the Internet together with video on demand have a direct impact to the speed of network links and performance of core routers. To achieve 100 Gbps throughput, core routers have to implement IP lookup in dedicated hardware and represent a forwarding table using a data structure, which fits into the onchip memory. Current IP lookup algorithms have high memory demands when representing IPv6 prefix sets or introduce very high pre-processing overhead. Therefore, we performed analysis of IPv4 and IPv6 prefixes in forwarding tables and propose a novel memory representation of IP prefix sets, which has very low memory demands. The proposed representation has better memory utilization in comparison to the highly optimized Shape Shifting Trie (SST) algorithm and it is also suitable for IP lookup in 100 Gbps networks, which is shown on a new pipelined hardware architecture with 170 Gbps throughput.
dcterms:title
Memory Efficient IP Lookup in 100 Gbps Networks Memory Efficient IP Lookup in 100 Gbps Networks
skos:prefLabel
Memory Efficient IP Lookup in 100 Gbps Networks Memory Efficient IP Lookup in 100 Gbps Networks
skos:notation
RIV/63839172:_____/13:10130212!RIV14-TA0-63839172
n18:predkladatel
n19:ico%3A63839172
n3:aktivita
n12:S n12:P n12:Z
n3:aktivity
P(ED1.1.00/02.0070), P(TA03010561), S, Z(MSM0021630528)
n3:dodaniDat
n9:2014
n3:domaciTvurceVysledku
n23:9461728
n3:druhVysledku
n17:D
n3:duvernostUdaju
n5:S
n3:entitaPredkladatele
n22:predkladatel
n3:idSjednocenehoVysledku
87183
n3:idVysledku
RIV/63839172:_____/13:10130212
n3:jazykVysledku
n16:eng
n3:klicovaSlova
Forwarding Table; Memory Demands; Longest Prefix Match; IP address
n3:klicoveSlovo
n4:Forwarding%20Table n4:IP%20address n4:Longest%20Prefix%20Match n4:Memory%20Demands
n3:kontrolniKodProRIV
[338E5F8B265C]
n3:mistoKonaniAkce
Porto, Portugalsko
n3:mistoVydani
Neuveden
n3:nazevZdroje
23rd International Conference on Field Programmable Logic and Applications (FPL'13)
n3:obor
n20:JC
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
3
n3:projekt
n6:ED1.1.00%2F02.0070 n6:TA03010561
n3:rokUplatneniVysledku
n9:2013
n3:tvurceVysledku
Matoušek, Jiří Skačan, Martin Kořenek, Jan
n3:typAkce
n15:WRD
n3:zahajeniAkce
2013-09-02+02:00
n3:zamer
n10:MSM0021630528
s:numberOfPages
8
n11:doi
10.1109/FPL.2013.6645519
n7:hasPublisher
IEEE
n21:isbn
978-1-4799-0004-6