International Journal of Advanced Research in Computer Science & Technology (IJARCST)
NIDS needed memory-efficient pattern-matching algorithm which can significantly reduce the memory requirement. Focus on reducing the memory size of the exact string patterns. To observe that many string patterns are similar because of common sub-strings. Proposed a state-traversal mechanism on a merge-FSM while achieving the same purposes of pattern matching. Since the number of states in merge-FSM can be drastically smaller than the original FSM, it results in a much smaller memory size. The hardware needed to support the state-traversal mechanism is also limited.