Detail publikace

Fast Lookup for Dynamic Packet Filtering in FPGA

Originální název

Fast Lookup for Dynamic Packet Filtering in FPGA

Anglický název

Fast Lookup for Dynamic Packet Filtering in FPGA

Jazyk

en

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.

Anglický 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.

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",
  annote="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.",
  address="IEEE Computer Society",
  booktitle="Proceedings of the 2014 IEEE 17th International Symposium on Design and Diagnostics of Electronic Circuits and Systems, DDECS 2014",
  chapter="111579",
  doi="10.1109/DDECS.2014.6868793",
  edition="NEUVEDEN",
  howpublished="print",
  institution="IEEE Computer Society",
  year="2014",
  month="april",
  pages="219--222",
  publisher="IEEE Computer Society",
  type="conference paper"
}