Coordinatore | INTERDISCIPLINARY CENTER (IDC) HERZLIYA
Spiacenti, non ci sono informazioni su questo coordinatore. Contattare Fabio per maggiori infomrazioni, grazie. |
Nazionalità Coordinatore | Israel [IL] |
Totale costo | 990˙400 € |
EC contributo | 990˙400 € |
Programma | FP7-IDEAS-ERC
Specific programme: "Ideas" implementing the Seventh Framework Programme of the European Community for research, technological development and demonstration activities (2007 to 2013) |
Code Call | ERC-2010-StG_20091028 |
Funding Scheme | ERC-SG |
Anno di inizio | 2010 |
Periodo (anno-mese-giorno) | 2010-11-01 - 2016-10-31 |
# | ||||
---|---|---|---|---|
1 |
THE HEBREW UNIVERSITY OF JERUSALEM.
Organization address
address: GIVAT RAM CAMPUS contact info |
IL (JERUSALEM) | beneficiary | 149˙999.60 |
2 |
INTERDISCIPLINARY CENTER (IDC) HERZLIYA
Organization address
address: Kanfei Nesharim contact info |
IL (HERZLIYA) | hostInstitution | 840˙400.40 |
3 |
INTERDISCIPLINARY CENTER (IDC) HERZLIYA
Organization address
address: Kanfei Nesharim contact info |
IL (HERZLIYA) | hostInstitution | 840˙400.40 |
Esplora la "nuvola delle parole (Word Cloud) per avere un'idea di massima del progetto.
'Deep packet inspection (DPI) lies at the core of contemporary Network Intrusion Detection/Prevention Systems and Web Application Firewall. DPI aims to identify various malware (including spam and viruses), by inspecting both the header and the payload of each packet and comparing it to a known set of patterns. DPI are often performed on the critical path of the packet processing, thus the overall performance of the security tools is dominated by the speed of DPI.
Traditionally, DPI considered only exact string patterns. However, in modern network devices patterns are often represented by regular expressions due to their superior expressiveness. Matching both exact string and regular expressions are well-studied area in Computer Science; however all well-known solutions are not sufficient for current network demands: First, current solutions do not scale in terms of speed, memory and power requirements. While current network devices work at 10-100 Gbps and have thousands of patterns, traditional solutions suffer from exponential memory size or exponential time and induce prohibitive power consumption. Second, non clear-text traffic, such as compressed traffic, becomes a dominant portion of the Internet and is clearly harder to inspect.
In this research we design new algorithms and schemes that cope with today demand. This is evolving area both in the Academia and Industry, where currently there is no adequate solution.
We intend to use recent advances in hardware to cope with these demanding requirements. More specifically, we plan to use Ternary Content-Addressable Memories (TCAMs), which become standard commodity in contemporary network devices. TCAMs can compare a key against all rules in a memory in parallel and thus provide high throughput. We believ'