Publication Details

Effective Hash-based IPv6 Longest Prefix Match

TOBOLA Jiří and KOŘENEK Jan. Effective Hash-based IPv6 Longest Prefix Match. In: IEEE Design and Diagnostics of Electronic Circuits and Systems DDECS'2011. Cottbus: IEEE Computer Society, 2011, pp. 325-328. ISBN 978-1-4244-9753-9.
Czech title
Efektivní algoritmus pro vyhledání IPv6 prefixů
Type
conference paper
Language
english
Authors
Tobola Jiří, Ing. (DCSY FIT BUT)
Kořenek Jan, doc. Ing., Ph.D. (DCSY FIT BUT)
Keywords

longest prefix match, IP look-up, IPv6, FPGA

Abstract

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.

Published
2011
Pages
325-328
Proceedings
IEEE Design and Diagnostics of Electronic Circuits and Systems DDECS'2011
Conference
IEEE International Symposium on Design and Diagnostics of Electronic Circuits and Systems 2011, Cottbus, DE
ISBN
978-1-4244-9753-9
Publisher
IEEE Computer Society
Place
Cottbus, DE
BibTeX 
@INPROCEEDINGS{FITPUB9602,
   author = "Ji\v{r}\'{i} Tobola and Jan Ko\v{r}enek",
   title = "Effective Hash-based IPv6 Longest Prefix Match",
   pages = "325--328",
   booktitle = "IEEE Design and Diagnostics of Electronic Circuits and Systems DDECS'2011",
   year = 2011,
   location = "Cottbus, DE",
   publisher = "IEEE Computer Society",
   ISBN = "978-1-4244-9753-9",
   language = "english",
   url = "https://www.fit.vut.cz/research/publication/9602"
}
Back to top