Predictive pattern matching for scalable network intrusion detection

0Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Signature-based network intrusion detection requires fast and reconfigurable pattern matching for deep packet inspection. This paper presents a novel pattern matching engine, which exploits a memory-based programmable state machine to achieve deterministic processing rates that are independent of packet and pattern characteristics. Our engine is a portable predictive pattern matching finite state machine (P3 FSM), which combines the properties of hardware-based systems with the portability and programmability of software. Specifically we introduce two methods, "Character Aware" and "SDFA", for encoding predictive state codes which can forecast the next states of our FSM. The result is software based pattern matching which is fast, reconfigurable, memory-efficient and portable. © 2009 Springer-Verlag.

Cite

CITATION STYLE

APA

Vespa, L., Mathew, M., & Weng, N. (2009). Predictive pattern matching for scalable network intrusion detection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5927 LNCS, pp. 254–267). https://doi.org/10.1007/978-3-642-11145-7_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free