By Topic

A descending suffix tree-based pattern matching algorithm for intrusion detection

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xie Yong ; Dept. of Inf., Jingdezhen Ceramic Inst., Jingdezhen, China ; He Fubao ; Zhang Yilai

Pattern matching is an important detecting method of a misuse intrusion detection system. With the increase in the number of rules, the performance of pattern matching algorithm has been a gradually decline and has been a bottleneck. A new type of pattern matching based on suffix tree is proposed. The method mines rule's data structure and prunes rule set based suffix tree, the model size of the search space has been reduced. Experiments show, compared to the conventional pattern matching method, it is an effective method to reduce the time of pattern matching, and improves the detection efficiency of intrusion detection systems.

Published in:

Consumer Electronics, Communications and Networks (CECNet), 2012 2nd International Conference on

Date of Conference:

21-23 April 2012