Reducing memory in high-speed packet classification

Kód výsledku v 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>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Reducing memory in high-speed packet classification

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Reducing memory in high-speed packet classification

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/LM2010005" target="_blank" >LM2010005: Velká infrastruktura CESNET</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2012

Kód důvěrnosti údajů

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

Název statě ve sborníku

Proceedings of the 8th International Wireless Communications and Mobile Computing Conference

ISBN

978-1-4577-1379-8

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

437-442

Název nakladatele

Institute of Electrical and Electronics Engineers ( IEEE )

Místo vydání

Limassol

Místo konání akce

Limassol, Kypr

Datum konání akce

27. 8. 2012

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000312146500072