Mend of AC-BM Algorithm and Application in Intrusion Detection Technique
Cai Yong
Abstract
Cai Yong
Abstract
This paper analyzes the problem of network intrusion detection and the traffic on the network. String matching becomes a bottleneck without a high-speed processing. A single string searching is not efficient for NIDS to inspect their packet payload. It does not keep up with the increasing network speeds. So we present an improved AC-BM algorithm in the paper. The algorithm is a Multi-pattern matching algorithm. As the paper shows, the performance of network intrusion detection is improved by the speed of the improved AC-BM algorithm.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper analyzes the problem of network intrusion detection and the traffic on the network. String matching becomes a bottleneck without a high-speed processing. A single string searching is not efficient for NIDS to inspect their packet payload. It does not keep up with the increasing network speeds. So we present an improved AC-BM algorithm in the paper. The algorithm is a Multi-pattern matching algorithm. As the paper shows, the performance of network intrusion detection is improved by the speed of the improved AC-BM algorithm.
Key concepts: Computer science, Bottleneck, Intrusion detection system, Algorithm, String searching algorithm, Payload (computing), Network packet, Matching (statistics)