Publication detail

Towards Hardware Architecture for Memory Efficient IPv4/IPv6 Lookup in 100 Gbps Networks

MATOUŠEK, J. SKAČAN, M. KOŘENEK, J.

Original Title

Towards Hardware Architecture for Memory Efficient IPv4/IPv6 Lookup in 100 Gbps Networks

Type

conference paper

Language

English

Original Abstract

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.

Keywords

IP address, Longest Prefix Match, Memory

Authors

MATOUŠEK, J.; SKAČAN, M.; KOŘENEK, J.

RIV year

2013

Released

8. 4. 2013

Publisher

IEEE Computer Society

Location

Brno

ISBN

978-1-4673-6136-1

Book

Proceedings of the 2013 IEEE 16th International Symposium on Design and Diagnostics of Electronic Circuits and Systems, DDECS 2013

Pages from

108

Pages to

111

Pages count

4

URL

https://www.fit.vut.cz/research/publication/10273/

BibTex

@inproceedings{BUT103466,
  author="Jiří {Matoušek} and Martin {Skačan} and Jan {Kořenek}",
  title="Towards Hardware Architecture for Memory Efficient IPv4/IPv6 Lookup in 100 Gbps Networks",
  booktitle="Proceedings of the 2013 IEEE 16th International Symposium on Design and Diagnostics of Electronic Circuits and Systems, DDECS 2013",
  year="2013",
  pages="108--111",
  publisher="IEEE Computer Society",
  address="Brno",
  doi="10.1109/DDECS.2013.6549798",
  isbn="978-1-4673-6136-1",
  url="https://www.fit.vut.cz/research/publication/10273/"
}