I-HASH multiple various position pattern matching algorithm in Internet application identification

The efficiency of multiple pattern matching is the core technology of Deep Packet Inspection and it is important to the real word of internet traffic analysis. In this research we propose a new multiple pattern matching technique for the fixed pattern in the packet load, which is called I-HASH multiple various position pattern matching algorithm. It is used to improve the matching speed through the preprocessing. Proposed algorithm is implemented in our experiments and compared with the existing method. The results demonstrate that our algorithm is much more effective than STRCMP algorithm, especially when the number of patterns is quiet large. This will be extraordinarily helpful in the areas of Internet application identification system and network intrusion detection system and so on, which contain huge amounts of fixed patterns.