Effective Hash-based IPv6 Longest Prefix Match
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F11%3APU96039" target="_blank" >RIV/00216305:26230/11:PU96039 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Effective Hash-based IPv6 Longest Prefix Match
Original language 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 sparseand 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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
IEEE Design and Diagnostics of Electronic Circuits and Systems DDECS'2011
ISBN
978-1-4244-9753-9
ISSN
—
e-ISSN
—
Number of pages
4
Pages from-to
325-328
Publisher name
IEEE Computer Society
Place of publication
Cottbus
Event location
Cottbus
Event date
Apr 13, 2011
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—