• KSII Transactions on Internet and Information Systems
    Monthly Online Journal (eISSN: 1976-7277)

An Efficient String Matching Algorithm Using Bidirectional and Parallel Processing Structure for Intrusion Detection System

Vol. 4, No.5, October 30, 2010
10.3837/tiis.2010.10.015, Download Paper (Free):

Abstract

Rapid growth of internet applications has increased the importance of intrusion detection system (IDS) performance. String matching is the most computation-consuming task in IDS. In this paper, a new algorithm for multiple string matching is proposed. This proposed algorithm is based on the canonical Aho-Corasick algorithm and it utilizes a bidirectional and parallel processing structure to accelerate the matching speed. The proposed string matching algorithm was implemented and patched into Snort for experimental evaluation. Comparing with the canonical Aho-Corasick algorithm, the proposed algorithm has gained much improvement on the matching speed, especially in detecting multiple keywords within a long input text string.


Statistics

Show / Hide Statistics

Statistics (Cumulative Counts from December 1st, 2015)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article

[IEEE Style]
Gwo-Ching Chang and Yue-Der Lin, "An Efficient String Matching Algorithm Using Bidirectional and Parallel Processing Structure for Intrusion Detection System," KSII Transactions on Internet and Information Systems, vol. 4, no. 5, pp. 956-967, 2010. DOI: 10.3837/tiis.2010.10.015

[ACM Style]
Chang, G. and Lin, Y. 2010. An Efficient String Matching Algorithm Using Bidirectional and Parallel Processing Structure for Intrusion Detection System. KSII Transactions on Internet and Information Systems, 4, 5, (2010), 956-967. DOI: 10.3837/tiis.2010.10.015