Přístupnostní navigace
E-application
Search Search Close
Publication result detail
PUŠ, V.; KOŘENEK, J.
Original Title
Fast and scalable packet classification using perfect hash functions
English Title
Type
Paper in proceedings outside WoS and Scopus
Original Abstract
Packet classification is an important operation for applications suchas routers, firewalls or intrusion detection systems. Many algorithmsand hardware architectures for packet classification have been created,but none of them can compete with the speed of TCAMs in the worst case.We propose new hardware-based algorithm for packet classification. Thesolution is based on problem decomposition and is aimed at the highestnetwork speeds. A unique property of the algorithm is the constant timecomplexity in terms of external memory accesses. The algorithm performsexactly two external memory accesses to classify a packet. Using FPGAand one commodity SRAM chip, a throughput of 150 million packets persecond can be achieved. This makes throughput of 100 Gbps for theshortest packets. Further performance scaling is possible with more orfaster SRAM chips.
English abstract
Keywords
classification, FPGA, perfect hash function
Key words in English
Authors
RIV year
2010
Released
28.05.2009
Publisher
Association for Computing Machinery
Location
New York
ISBN
978-1-60558-410-2
Book
Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays
Edition
Pages from
229
Pages to
236
Pages count
8
URL
https://www.fit.vut.cz/research/publication/8952/
BibTex
@inproceedings{BUT33726, author="Viktor {Puš} and Jan {Kořenek}", title="Fast and scalable packet classification using perfect hash functions", booktitle="Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays", year="2009", series="Association for Computing Machinery", pages="229--236", publisher="Association for Computing Machinery", address="New York", isbn="978-1-60558-410-2", url="https://www.fit.vut.cz/research/publication/8952/" }
Documents
fpga57-pus