Sampling Techniques to Accelerate Pattern Matching in Network Intrusion Detection Systems

• Published in: 2010 IEEE International Conference on Communications pp. 1 - 5
• Main Authors: Ficara, D, Antichi, G, Di Pietro, A, Giordano, S, Procissi, G, Vitucci, F
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.05.2010
• Subjects: Acceleration; Automata; Birth disorders; Communications Society; Doped fiber amplifiers; Inspection; Intrusion detection; Pattern matching; Power engineering and energy; Sampling methods
• ISBN: 1424464021; 9781424464029
• ISSN: 1550-3607; 1938-1883
• DOI: 10.1109/ICC.2010.5501751

Modern network devices need to perform deep packet inspection at high speed for security and application-specific services. Instead of standard strings to represent the dataset to be matched, state-of-the-art systems adopt regular expressions, due to their high expressive power. The current trend is to use Deterministic Finite Automata (DFAs) to match regular expressions. However, while the problem of the large memory consumption of DFAs has been solved in many different ways, only a few works have focused on increasing the lookup speed. This paper introduces a novel yet simple idea to accelerate DFAs for security applications: payload sampling. Our approach allows to skip a large portion of the text, thus processing less bytes. The price to pay is a slight number of false alarms which require a confirmation stage. Therefore, we propose a double-stage matching scheme providing two new different automata. Results show a significant speed-up in regular traffic processing, thus confirming the effectiveness of the approach.