Novel Devaki Paul Algorithm for Multiple Pattern Matching

Abstract

matching is one of the major issues in the area of network security and also in many other areas. The increase in network speed and traffic may cause the existing algorithms to become a performance bottleneck. Therefore, it is very necessary to develop more efficient pattern matching algorithm, in order to overcome troubles on performance. There are several algorithms in use, in which, DP algorithm (Devaki - Paul algorithm) is yielding good results in many cases. However, this algorithm was proposed only for the single pattern matching. But, now-a-days it is very necessary to find the multiple patterns in NIDS etc. In this paper, we are giving a new proposal to the DP algorithm (Devaki - Paul algorithm) to make it efficient and works also for the multiple pattern matching. The algorithm was tested and validated and the results have proved that the performance of DP algorithm is better than BM algorithm (Boyer - Moore algorithm) and the Quick Search algorithm. In case of tests with repeated character, its performance is greater than 1%~50% with BM and Quick Search algorithms. In case of tests with the English Text and Random Pattern, it's greater than 33%~91% with BM and 37%~85% with Quick Search algorithms. In case of tests with the English Text and Random Pattern of an unsuccessful search, its performance is greater than BM and Quick Search algorithms with 100%, if either the first and/or the last character of the pattern in the given text were not present.