NDLI: Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia

Please wait, while we are loading the content...

Ruler: high-speed packet matching and rewriting on NPUs

Experimental evaluation of a coarse-grained switch scheduler

Design of adaptive communication channel buffers for low-power area-efficient network-on-chip architecture

Low-latency scheduling in large switches

Compiling PCRE to FPGA for accelerating SNORT IDS

Enhancing interoperability and stateful analysis of cooperative network intrusion detection systems

Optimization of pattern matching algorithm for memory based architecture

Design of a network architecture with inherent data path security

Performance scalability of a multi-core web server

On LID assignment in infiniBand networks

High-speed packet classification using binary search on length

High-speed detection of unsolicited bulk emails

Towards high-performance flow-level packet processing on multi-core network processors

Experimenting with buffer sizes in routers

Automated task distribution in multicore network processors using statistical analysis

Frame-aggregated concurrent matching switch

An improved algorithm to accelerate regular expression evaluation

A programmable message classification engine for session initiation protocol (SIP)

Frame shared memory: line-rate networking on commodity hardware

To CMP or not to CMP: analyzing packet classification on modern and traditional parallel architectures

Optimal packet scheduling in output-buffered optical switches with limited-range wavelength conversion

Congestion management for non-blocking clos networks

Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia

DPICO: a high speed deep packet inspection engine using compact finite automata

Flow-slice: a novel load-balancing scheme for multi-path switching systems

Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia

Content Provider	ACM Digital Library
Author	Chandrasekaran, Balakrishnan Varghese, George Turner, Jonathan Kumar, Sailesh
Abstract	The importance of network security has grown tremendously and a collection of devices have been introduced, which can improve the security of a network. Network intrusion detection systems (NIDS) are among the most widely deployed such system; popular NIDS use a collection of signatures of known security threats and viruses, which are used to scan each packet's payload. Today, signatures are often specified as regular expressions; thus the core of the NIDS comprises of a regular expressions parser; such parsers are traditionally implemented as finite automata. Deterministic Finite Automata (DFA) are fast, therefore they are often desirable at high network link rates. DFA for the signatures, which are used in the current security devices, however require prohibitive amounts of memory, which limits their practical use. In this paper, we argue that the traditional DFA based NIDS has three main limitations: first they fail to exploit the fact that normal data streams rarely match any virus signature; second, DFAs are extremely inefficient in following multiple partially matching signatures and explodes in size, and third, finite automaton are incapable of efficiently keeping track of counts. We propose mechanisms to solve each of these drawbacks and demonstrate that our solutions can implement a NIDS much more securely and economically, and at the same time substantially improve the packet throughput.
Starting Page	155
Ending Page	164
Page Count	10
File Format	PDF
ISBN	9781595939456
DOI	10.1145/1323548.1323574
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2007-12-03
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Regular expressions Deep packet inspection Dfa
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia (2007).

Algorithms to accelerate multiple regular expressions matching for deep packet inspection

Fast and memory-efficient regular expression matching for deep packet inspection

Advanced algorithms for fast and scalable deep packet inspection

Algorithms to accelerate multiple regular expressions matching for deep packet inspection

Curing Regular Expressions Matching Algorithms from Insomnia, Amnesia, and Acalculia (2007)

Curing Regular Expressions Matching Algorithms from Insomnia, Amnesia, and Acalculia (2007)

Fast and Compact Regular Expression Matching Using Character Substitution

A Comparative Study on DFA-Based Pattern Matching for Deep Packet Inspection

Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia

Similar Documents

Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia (2007).

Algorithms to accelerate multiple regular expressions matching for deep packet inspection

Fast and memory-efficient regular expression matching for deep packet inspection

Advanced algorithms for fast and scalable deep packet inspection

Algorithms to accelerate multiple regular expressions matching for deep packet inspection

Curing Regular Expressions Matching Algorithms from Insomnia, Amnesia, and Acalculia (2007)

Curing Regular Expressions Matching Algorithms from Insomnia, Amnesia, and Acalculia (2007)

Fast and Compact Regular Expression Matching Using Character Substitution

A Comparative Study on DFA-Based Pattern Matching for Deep Packet Inspection

Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia