Analyze and improvement of BM algorithm

Authors:
Yang Tong;Wang Si-si;Qiao Xiang-dong;Chen Qi
Affiliations:
Telecommunication Engineering Institute, Air force Engineering Univ., Xi'an, Shannxi, China;Air Force Command College, Beijing, China;Telecommunication Engineering Institute, Air force Engineering Univ., Xi'an, Shannxi, China;School of Electronic Science and Technology, National University of Defense Technology, Changsha, hunan, China
Venue:
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Year:
2009

Citing 4
Cited 0

A very fast substring search algorithm

Communications of the ACM
A fast string searching algorithm

Communications of the ACM
Generating realistic workloads for network intrusion detection systems

WOSP '04 Proceedings of the 4th international workshop on Software and performance
A fast string search algorithm for deep packet classification

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

when network is overload, snort spends a lot of time to matching rules. The algorithm determines the performance of intrusion detection system to a large extent. Snort adopts BM algorithm in default, in order to enhance the efficiency of network intrusion detection system which is based on snort, this paper analyzes BM algorithm firstly, and proposes an improved algorithm. Secondly, this thesis compares the two algorithms (BM algorithm and the improved BM algorithm) theoretically, and does a quantitative description of the extent of the improved BM algorithm according to the experimental results. Finally, the improve BM algorithm is applied to the network intrusion detection system, and have achieved good results.