Abstract

This paper presents an efficient method for Regular Expression Matching (REM) by reusing Intellectual Property (IP) cores in a new architecture of Network on Chip (NoC). The method is to design a reusable IP core which consists of many engine cells for REM and to implement each engine cell on a Field Programmable Gate Array (FPGA) as a prototype. To make Finite State Machine (FSM) simpler, a new approach for partitioning a regular expression into several smaller parts is proposed. Each part of a regular expression was matched by an engine cell during matching, and each engine cell communicates with others by routers on a NoC topology. The proposed NoC architecture is a general-purpose design which is suitable for different rule libraries in deep packet inspection (DPI). It can deal with the problem that character self-deplete made the correct regular expression matching missing. A way to use both logic cell and RAM available on FPGA devices is described, and it can make it easier to change the rule library of regular expressions in the RAM. The implementation of the NoC architecture by employing application-specific integrated circuits (ASIC) is finally discussed.

Highlights

  • With the rapid development of network applications, network security becomes more and more important against system intrusion

  • A regular expression is often represented by deterministic finite automata (DFA) or non-deterministic finite automata (NFA)

  • We proposed a new NFA that is suitable for our new Network on Chip (NoC) architecture based on the basic IC design rules

Read more

Summary

Introduction

With the rapid development of network applications, network security becomes more and more important against system intrusion. Forwarding packets based on content requires new levels of support in networking equipment. A regular expression, often called a pattern, is an expression that specifies a set of strings. To specify such sets of strings, rules are often more concise than lists of a set's members. Regular expression matching is one of main mechanism that used by Intrusion Detection Systems (IDS) like Snort [1] or simpler ones like L7-filter [2] even some email spam filter. A regular expression is often represented by deterministic finite automata (DFA) or non-deterministic finite automata (NFA). Regular expression gains widespread adoption for deep packet inspection together with the network application. To implement REM in hardware has been widely studied be-

Methods
Results
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call