By Topic

A Fast Determinate String Matching Algorithm for the Network Intrusion Detection Systems

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

2 Author(s)
Cheng Zhong ; Guangxi Univ., Nanning ; Guo-liang Chen

A perfect hash function for processing string is constructed by applying the Chinese remainder theorem, and a fast string matching algorithm, which is suited to process the successive sequences like the network traffic data, is presented. The theoretical analysis shows that this algorithm not only obtains the determinate match results but also holds a linear time complexity in the worst case. The experiment results for matching a sequence database in the network intrusion detection systems also shows that this algorithm is efficient.

Published in:

Machine Learning and Cybernetics, 2007 International Conference on  (Volume:6 )

Date of Conference:

19-22 Aug. 2007