Reducing memory in high-speed packet classification

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F63839172%3A_____%2F12%3A00007356" target="_blank" >RIV/63839172:_____/12:00007356 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Reducing memory in high-speed packet classification
Original language description
Many packet classification algorithms were proposed to deal with the rapidly growing speed of computer networks. Unfortunately all of these algorithms are able to achieve high throughput only at the cost of excessively large memory and can be used only for small sets of rules. We propose new algorithm that uses four techniques to lower the memory requirements: division of rule set into subsets,removal of critical rules,prefix coloring and perfect hashing. The algorithm is designed for pipelined hardwareimplementation,can achieve the throughput of 266 million packets per second,which corresponds to 178 Gb/s for the shortest 64B packets,and outperforms older approaches in terms of memory requirements by 66 % in average for the rule sets available to us.
Czech name
—
Czech description
—

Project
<a href="/en/project/LM2010005" target="_blank" >LM2010005: Large Infrastructure CESNET</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Proceedings of the 8th International Wireless Communications and Mobile Computing Conference
ISBN
978-1-4577-1379-8
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
437-442
Publisher name
Institute of Electrical and Electronics Engineers ( IEEE )
Place of publication
Limassol
Event location
Limassol, Kypr
Event date
Aug 27, 2012
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000312146500072

Similar results(10)