Module for hash-based pattern matching using approximate computing techniques

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F21%3APR36221" target="_blank" >RIV/00216305:26230/21:PR36221 - isvavai.cz</a>

Výsledek na webu

<a href="https://wis.fit.vutbr.cz/FIT/db/vav/view_product.php?id=711" target="_blank" >https://wis.fit.vutbr.cz/FIT/db/vav/view_product.php?id=711</a>

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Module for hash-based pattern matching using approximate computing techniques

Popis výsledku v původním jazyce

This software package contains an acceleration component for regular expression matching. To reduce the hardware resource requirements, approximate computing techniques are used. The standard pattern matching is replaced by matching only short strings derived from the original regular expression set. Hardware resources are significantly reduced at the cost of a slight decrease in matching accuracy. The approximation allows only false-positive matches, which are subsequently removed in detailed software processing. The Acceleration components are fully configurable and support processing of input data at throughputs in the order of hundreds of Gb/s for large rule sets. In addition, the rule set can be dynamically modified on the fly. The package also includes a tool for deriving short strings from the original regular expression set. Using graph algorithms, significant strings are extracted from the regular expressions. Using the input data (network traffic) model, the strings are derived to keep their probability in the input data as low as possible to maximize search accuracy.

Název v anglickém jazyce

Module for hash-based pattern matching using approximate computing techniques

Popis výsledku anglicky

This software package contains an acceleration component for regular expression matching. To reduce the hardware resource requirements, approximate computing techniques are used. The standard pattern matching is replaced by matching only short strings derived from the original regular expression set. Hardware resources are significantly reduced at the cost of a slight decrease in matching accuracy. The approximation allows only false-positive matches, which are subsequently removed in detailed software processing. The Acceleration components are fully configurable and support processing of input data at throughputs in the order of hundreds of Gb/s for large rule sets. In addition, the rule set can be dynamically modified on the fly. The package also includes a tool for deriving short strings from the original regular expression set. Using graph algorithms, significant strings are extracted from the regular expressions. Using the input data (network traffic) model, the strings are derived to keep their probability in the input data as low as possible to maximize search accuracy.

Druh

R - Software

CEP obor

—

OECD FORD obor

20206 - Computer hardware and architecture

Projekt

<a href="/cs/project/VI20192022143" target="_blank" >VI20192022143: Flexibilní sonda pro realizaci zákonných odposlechů</a><br>

Návaznosti

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

Rok uplatnění

2021

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ů

Interní identifikační kód produktu

Hash-based pattern match

Technické parametry

Pro informace o licenčních podmínkách prosím kontaktujte: Ing. Kristýna Dvořáčkova, MSc., Výzkumné centrum informačních technologií, Fakulta informačních technologií VUT v Brně, Božetěchova 2, 612 66 Brno, tel. 541 141 466.

Ekonomické parametry

Software se poskytuje v souladu s licenční politikou projektu Flexibilní sonda pro realizaci zákonných odposlechů MV, VI20192022143.

IČO vlastníka výsledku

00216305

Název vlastníka

Vysoké učení technické v Brně