Papers by Author: Ho Cholman

Abstract: String matching is a key problem in many network processing applications. Current implementations of this process using software are time consuming. This paper presents a string matching system that based on FPGA. This paper uses DM9000A to receive network data and uses Snort rule and HashMem function to match pattern. With software simulation the conflict pattern of Snort rules found out and processed separately. In the system, conflict can be high-speed solved. With the PC handle string matching that more than 16 Byte, the FPGA processing speed has improved greatly .The experimental results show that the system throughput is 1.22Gbps, more than 20 times of the software method. When processing more Snort rules system throughput is not affected. Experimental results show that the system can quickly adapt to the demand for hardware reconfiguration and meet the network application requirements.

Abstract: Intrusion detection for network security is an application area demanding high throughput. The pattern matching in intrusion detection requires extremely high performance to process string matching. Most of pattern matching using software has many time complexities and cannot reach the requirements of high throughput. The pattern matching using hardware considerably improves the speed of matching and has several other advantages. This paper describes a FPGA-based pattern matching architecture, using hashing method called XOR Hashing. The proposed method updates new patterns without reconfiguration and processes the collision and has high matching performance. The proposed system implements the pattern matching by using Snort rule-set, an open source Network Intrusion Detection and has simulation processing on PC. Compared with existing hardware method, the results explained that our method has relatively high performance for the pattern matching and can else process the pattern matching with high performance on low–cost FPGA device.