An independently partial pattern matching for content inspection at multi gigabit networks

In this paper, we propose a novel algorithm for pattern matching at multi gigabit network. It is called as the IPM. Our proposed algorithm can minimize the system overhead which is generated to extract patterns at out-of-sequence packets since the IPM does not require a buffering, reordering and reassembling to keep sequence of packets. Our proposed algorithm performs independently partial pattern matching to extract the pattern from incoming multiple packets at multi gigabit network. The IPM is implemented by FPGA, TCAM and SRAM. Consequently, we show the IPM can reduce 87% of TCAM entries to extract 17 bytes pattern and w = 4. Moreover, we observed that IPM can perform the scanning of packets at 10.941Gbps and it spent 5.79LC/Char to implement the IPM. Then, we achieved the 1.89 Gbps/LC of PHC score. This means that IPM provides the optimal performance in contrast with hardware complexity. Therefore, we propose the cost-effective algorithm to extract the pattern at multi gigabit network.