Regular expression matching method based on smart finite automaton (SFA)

A finite automaton, expression matching technology, used in special data processing applications, instruments, electrical digital data processing, etc.

Inactive Publication Date: 2011-09-14
HUNAN YIGU TECH DEV
View PDF2 Cites 27 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

When the string abcdabcdabcdefgh is read in, the state transition sequence of XFA is 0→1→2→3→4→1→2→3→4→1→2→3→4→5→6→7→8, where the state 1, 2, 3 and 4 appear repeatedly three times; when reaching state 3 for the first time, the auxiliary variable Bit1 is set to 1, indicating that ...

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Regular expression matching method based on smart finite automaton (SFA)
  • Regular expression matching method based on smart finite automaton (SFA)
  • Regular expression matching method based on smart finite automaton (SFA)

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0037] In order to solve the redundant migration edge problem of XFA, this paper proposes a smart finite automaton (SFA), that is, on the basis of XFA, adding auxiliary variable judgment instructions, eliminating unnecessary state transitions, thereby reducing the storage space overhead of XFA and improving its matching efficiency. The source of inspiration for SFA is based on observations of DFA state transitions: as figure 1 As shown, when the string abababcd is read, the state transition sequence of DFA is P→Q→R→R→R→R→R→S→T, where state R repeats 5 times; since state R of DFA has memory Function, that is, the record has partially matched the string ab, waiting for the subsequent string cd, when a non-cd string is read, the DFA always migrates to the state R, and will not fall back to the state P or Q before R. Therefore, although XFA uses auxiliary variables and operation instructions to eliminate the problem of DFA state space explosion, it also deletes the memory functio...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a regular expression matching method based on a smart finite automaton (SFA), which comprises the steps of: selecting a proper regular expression rule set; and constructing the SFA; respectively carrying out character string matching on each read test set by an SFA matching method, and carrying out statistics on matching results. Experiment results indicate that: compared with an XFA (Xml Forms Architecture), the SFA has storage space overhead reduced by 44.1 percent, storage access frequency reduced by 69.1 percent and improved space-time efficiency of matching the regular expression. According to the invention, the problem of redundancy mobility edge existing in the XFA is solved, storage space can be effectively saved, and performances of the XFA are improved. Under the environment that the current network bandwidth and the traffic flow rapidly increase, the regular expression matching method provides an effective solution scheme for throughput requirements and storage space demands of line speed data packet processing during application.

Description

technical field [0001] The invention relates to electronic computer network technology, in particular to a regular expression matching method based on an intelligent limited automaton. Background technique [0002] Network Intrusion Detection and Prevention Systems (NIDS / NIPS) is an important means of network security defense, that is, by monitoring network traffic in real time, checking the header information and payload of each data packet (that is, the content of the data packet) , to identify and block suspicious behavior on the network. The core of NIDS / NIPS is Deep Packet Inspection (DPI), which uses a feature matching algorithm to match the content of each data packet with a set of predefined features. DPI technology is not only applied to NIDS / NIPS, but also applied to application layer data packet classification, P2P traffic identification, content-based traffic billing, etc. [0003] Feature matching algorithms can be divided into string matching algorithms and r...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F17/30
Inventor 李彦彪徐析张洁坤黄昆
Owner HUNAN YIGU TECH DEV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap