All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Scalability of Hash-based Pattern Matching for High-speed Network Security and Monitoring

The result's identifiers

  • Result code in IS VaVaI

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

  • Result on the web

    <a href="https://ieeexplore.ieee.org/document/9631447" target="_blank" >https://ieeexplore.ieee.org/document/9631447</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/ISCC53001.2021.9631447" target="_blank" >10.1109/ISCC53001.2021.9631447</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Scalability of Hash-based Pattern Matching for High-speed Network Security and Monitoring

  • Original language description

    Gradually increasing throughput of high-speed networks puts continuous pressure on the performance of operations over a stream of network data. Probably the most affected operation in the area of network security and monitoring is pattern matching, which is in the core of widely deployed intrusion detection systems (IDSes) like Snort, Suricata and Bro. This paper therefore proposes several optimizations of a hash-based pattern matching architecture that together allow to increase its throughput to 100 Gbps and beyond. Proposed optimizations target an interconnection network between parallel hash function engines and independent memory blocks addressed by hashes computed over short strings of input data. Specifically, the optimizations reduce resource utilization by sharing parts of the full interconnection network among its several outputs and lower collision rate in these shared parts by aggregation and distributed buffering of memory access requests. The optimized pattern matching architecture is therefore able to utilize a  higher number of parallel hash functions, each of which can use the interconnection network to access any memory block. This allows not only to increase the throughput of a key component within IDSes to more than 100 Gbps, but also to support a larger set of network threat patterns and to update this set dynamically.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/VI20192022143" target="_blank" >VI20192022143: Flexible probe for lawful interceptions</a><br>

  • Continuities

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

Others

  • Publication year

    2021

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    Proceedings - IEEE Symposium on Computers and Communications

  • ISBN

    978-1-6654-2744-9

  • ISSN

  • e-ISSN

  • Number of pages

    6

  • Pages from-to

    1-6

  • Publisher name

    Institute of Electrical and Electronics Engineers

  • Place of publication

    Athens

  • Event location

    Athens

  • Event date

    Sep 5, 2021

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article