Detail publikace

Fast Lookup for Dynamic Packet Filtering in FPGA

KEKELY, L. ŽÁDNÍK, M. MATOUŠEK, J. KOŘENEK, J.

Originální název

Fast Lookup for Dynamic Packet Filtering in FPGA

Typ

článek ve sborníku ve WoS nebo Scopus

Jazyk

angličtina

Originální abstrakt

Rapidly growing speed and complexity of computer networks impose new requirements on fast lookup structures which are utilized in many networking applications (SDN, firewalls, NATs, etc.). We propose a novel lookup concept based on the well-known cuckoo hashing, which can achieve good memory utilization, supplemented by a binary search tree for offloading the colliding keys and supporting LPM lookup. We also propose a hardware architecture implementing this lookup concept in the FPGA. Our solution is suitable for lookup of the variable-length keys in 100+Gbps networks. Memory utilization of the proposed concept is thoroughly evaluated and it is shown that the concept is scalable to external memory components.

Klíčová slova

Cuckoo hash, binary search, packet filtering, FPGA

Autoři

KEKELY, L.; ŽÁDNÍK, M.; MATOUŠEK, J.; KOŘENEK, J.

Rok RIV

2014

Vydáno

30. 7. 2014

Nakladatel

IEEE Computer Society

Místo

Warszawa

ISBN

978-1-4799-4558-0

Kniha

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

Strany od

219

Strany do

222

Strany počet

4

URL

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

BibTex

@inproceedings{BUT111579,
  author="Lukáš {Kekely} and Martin {Žádník} and Jiří {Matoušek} and Jan {Kořenek}",
  title="Fast Lookup for Dynamic Packet Filtering in FPGA",
  booktitle="Proceedings of the 2014 IEEE 17th International Symposium on Design and Diagnostics of Electronic Circuits and Systems, DDECS 2014",
  year="2014",
  pages="219--222",
  publisher="IEEE Computer Society",
  address="Warszawa",
  doi="10.1109/DDECS.2014.6868793",
  isbn="978-1-4799-4558-0",
  url="https://www.fit.vut.cz/research/publication/10615/"
}