ACM Home Page
Please provide us with feedback. Feedback
Packet pre-filtering for network intrusion detection
Full text PdfPdf (632 KB)
Source Symposium On Architecture For Networking And Communications Systems archive
Proceedings of the 2006 ACM/IEEE symposium on Architecture for networking and communications systems table of contents
San Jose, California, USA
SESSION: End-to-end security table of contents
Pages: 183 - 192  
Year of Publication: 2006
ISBN:1-59593-580-0
Authors
Ioannis Sourdis  TU Delft, The Netherlands
Vasilis Dimopoulos  Technical University of Crete, Crete, Greece
Dionisios Pnevmatikatos  Technical University of Crete, Crete, Greece and Institute of Computer Science (ICS), Crete, Greece
Stamatis Vassiliadis  TU Delft, The Netherlands
Sponsors
ACM: Association for Computing Machinery
SIGARCH: ACM Special Interest Group on Computer Architecture
SIGCOMM: ACM Special Interest Group on Data Communication
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 17,   Downloads (12 Months): 87,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1185347.1185372
What is a DOI?

ABSTRACT

As Intrusion Detection Systems (IDS)utilize more complex syntax to efficiently describe complex attacks, their processing requirements increase rapidly. Hardware and, even more, software platforms face difficulties in keeping up with the computationally intensive IDS tasks, and face overheads that can substantially diminish performance.In this paper we introduce a packet pre-filtering approach as a means to resolve, or at least alleviate, the increasing needs of current and future intrusion detection systems. We observe that it is very rare for a single incoming packet to fully or partially match more than a few tens of IDS rules. We capitalize on this observation selecting a small portion from each IDS rule to be matched in the pre-filtering step. The result of this partial match is a small subset of rules that are candidates for a full match. Given this pruned set of rules that can apply to a packet, a second-stage, full-match engine can sustain higher throughput.We use DefCon traces and recent Snort IDS rule-set,and show that matching the header and up to an 8-character prefix for each payload rule on each incoming packet can determine that on average 1.8 rules may apply on each packet, while the maximum number of rules to be checked across all packets is 32. Effectively, packet pre-filtering prevents matching at least 99%of the SNORT rules per packet and as a result minimizes processing and improves the scalability of the system. We also propose and evaluate the cost and performance of a reconfigurable architecture that uses multiple processing engines in order to exploit the benefits of pre-filtering.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
S. Antonatos, M. Polychronakis, P. Akritidis, K. D. Anagnostakis, and E. P. Markatos. Piranha: Fast and memory-efficient pattern matching for intrusion detection.In Proceedings 20th IFIP International Information Security Conference (SEC 2005) May 2005.
 
2
 
3
J. Bispo, I. Sourdis, J. M. Cardoso, and S. Vassiliadis. Regular Expression Matching for Reconfigurable Packet Inspection. In IEEE International Conference on Field Programmable Technology (FPT)2006.
 
4
 
5
V. Dimopoulos, G. Papadopoulos, and D. Pnevmatikatos. On the importance of header classification in hw/sw network intrusion detection systems. In Proceedings of the 10th Panhel lenic Conference on Informatics (PCI)November 11-13, 2005.
 
6
 
7
 
8
E. Markatos, S. Antonatos, M. Polyhronakis, and K. G. Anagnostakis. Exclusion-based signature matching for intrusion detection. In Proceedings of the IASTED International Conference on Communications and Computer Networks (CCN) pages 146--152, November 2002.
 
9
 
10
G. Papadopoulos and D. Pnevmatikatos. Hashing + Memory =Low Cost, Exact Pattern Matching. In Proceedings of 15th International Conference on Field Programmable Logic and Applications 2005.
 
11
 
12
SNORT official web site.http://www.snort.org.
13
 
14
Sourcefire. Snort rule optimizer. In www.sourcefire.com/whitepapers/sf snort20 ruleop.pdf June 2002.
 
15
 
16
I. Sourdis, D. Pnevmatikatos, S. Wong, and S. Vassiliadis. A Reconfigurable Perfect-Hashing Scheme for Packet Inspection. In Proceedings of 15th Int. Conf. on Field Programmable Logic and Applications 2005.
 
17
The Shmoo Group: the Capture the Flag Data. http://cctf.shmoo.com/.


Collaborative Colleagues:
Ioannis Sourdis: colleagues
Vasilis Dimopoulos: colleagues
Dionisios Pnevmatikatos: colleagues
Stamatis Vassiliadis: colleagues