Publication Details

Packet Classification with Limited Memory Resources

KEKELY, M.; KOŘENEK, J. Packet Classification with Limited Memory Resources. In In proceedings 2017 Euromicro Conference on Digital System Design. Vieden: Institute of Electrical and Electronics Engineers, 2017. p. 179-183. ISBN: 978-1-5386-2145-5.
Czech title
Klasifikace paketú s omezenými zdroji
Type
conference paper
Language
English
Authors
Kekely Michal, Ing., Ph.D.
Kořenek Jan, doc. Ing., Ph.D. (DCSY)
Keywords

DCFL, packet classification, FPGA, P4

Abstract

Network security and monitoring devices use packet classification to match packet header fields in a set of rules. Many hardware architectures have been designed to accelerate packet classification and achieve wire-speed throughput for 100Gbps networks. The architectures are designed for high throughput even for the shortest packets. However, FPGA SoC and Intel Xeon with FPGA have limited resources for multiple accelerators. Usually, it is necessary to balance between available resources and the level of acceleration. Therefore, we have designed new hardware architecture for packet classification, which can balance between the processing speed and hardware resources. To achieve 10 Gbps average throughput the architecture need only 20 BlockRAMs for 5500 rules. Moreover, the architecture can scale the processing speed to wire-speed throughput on 100 Gbps line at the cost of additional memory resources.

Published
2017
Pages
179–183
Proceedings
In proceedings 2017 Euromicro Conference on Digital System Design
ISBN
978-1-5386-2145-5
Publisher
Institute of Electrical and Electronics Engineers
Place
Vieden
DOI
UT WoS
000427097100024
EID Scopus
BibTeX
@inproceedings{BUT144481,
  author="Michal {Kekely} and Jan {Kořenek}",
  title="Packet Classification with Limited Memory Resources",
  booktitle="In proceedings 2017 Euromicro Conference on Digital System Design",
  year="2017",
  pages="179--183",
  publisher="Institute of Electrical and Electronics Engineers",
  address="Vieden",
  doi="10.1109/DSD.2017.61",
  isbn="978-1-5386-2145-5"
}
Back to top