Publication Details
Towards Hardware Architecture for Memory Efficient IPv4/IPv6 Lookup in 100 Gbps Networks
Skačan Martin, Ing. (FIT BUT)
Kořenek Jan, doc. Ing., Ph.D. (DCSY FIT BUT)
IP address, Longest Prefix Match, Memory
With the growing speed of computer networks, core routers have to increase performance of longest prefix match (LPM) operation on IP addresses. While existing LPM algorithms are able to achieve high throughput for IPv4 addresses, the IPv6 processing speed is limited. To achieve 100 Gbps throughput, LPM operation has to be processed in dedicated hardware and a forwarding table has to fit into the on-chip memory. Current LPM algorithms need a large memory to store IPv6 forwarding tables or use compression with dynamic data structres, which can not be simply implemented in hardware. Therefore we provide analysis of available forwarding tables of core routers and propose a new representation of prefix sets. The proposed representation has very low memory demands and is suitable for high-speed pipelined processing, which is shown on new highly pipelined hardware architecture with 100 Gbps throughput.
@INPROCEEDINGS{FITPUB10273,
author = "Ji\v{r}\'{i} Matou\v{s}ek and Martin Ska\v{c}an and Jan Ko\v{r}enek",
title = "Towards Hardware Architecture for Memory Efficient IPv4/IPv6 Lookup in 100 Gbps Networks",
pages = "108--111",
booktitle = "Proceedings of the 2013 IEEE 16th International Symposium on Design and Diagnostics of Electronic Circuits and Systems, DDECS 2013",
year = 2013,
location = "Brno, CZ",
publisher = "IEEE Computer Society",
ISBN = "978-1-4673-6136-1",
doi = "10.1109/DDECS.2013.6549798",
language = "english",
url = "https://www.fit.vut.cz/research/publication/10273"
}