# US 2003/0229710 A1 · Method for matching complex patterns in IP data streams

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2003/0229710 A1
- Document ID: US20030229710A1
- Status: Published application
- Kind: A1
- Application number: 10/166,914
- Filed: 2002-06-11
- Published: 2003-12-11
- Earliest claimed: 2002-06-11
- Assignees: Netrake Corporation
- Inventors: Milton Andre Lie; Yu Xia; Darren Bensley
- Web page: https://patentgrep.com/patent/US20030229710A1

## CPC

- H04L 47/10: Flow control; Congestion control
- H04L 45/60: Router architectures
- H04L 47/22: Traffic shaping
- H04L 47/2483: involving identification of individual flows
- H04L 47/32: by discarding or delaying data units, e.g. packets or frames
- H04L 47/50: Queue scheduling
- H04L 47/6215: {Individual queue per QOS, rate or priority}
- H04L 63/1416: {Event detection, e.g. attack signature detection}
- H04L 63/145: {the attack involving the propagation of malware through the network, e.g. viruses, trojans or worms}
- H04L 63/1458: {Denial of Service}
- H04L 47/43: Assembling or disassembling of packets, e.g. segmentation and reassembly [SAR]
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A method is described for matching complex patterns in internet protocol (IP) data streams. The method associates each data packet with a specific flow in the IP data stream. The packet is broken into fixed length contexts and state information for that flow is retrieved. The method then determines using a data base of known signatures and the state information whether there is a potential match between the incoming data stream and a signature in the database of known signatures. If a potential match is found the method then determines whether there is an exact match between the potential signature and the incoming data stream. The state information is then updated to reflect the outcome of the scanning. When and exact match is found a conclusion is reached that determines the treatment for the incoming data stream. The state information allows the pattern matching engine to match patterns across packet boundaries and to perform complex matches.

## Claims

### Claim 1

A method for matching an incoming data stream in the form of IP packets to a database of known signatures stored in memory, the method comprising:
breaking the incoming data stream into at least one fixed length context;
retrieving state information related to the incoming data stream;
determining, by using the state information in conjunction with the incoming data stream, whether the context has any potential pattern matches in the database of known signatures; and
determining, when a potential pattern match has been identified, whether the context has an exact pattern match from the potential pattern match.

### Claim 2 (depends on 1)

The method as recited in claim 1 further comprising storing state information related to the potential and exact pattern matches.

### Claim 3 (depends on 2)

The method as recited in claim 2 wherein pattern matching occurs across at least one IP packet boundary.

### Claim 4 (depends on 1)

The method as recited in claim 1 wherein multiple contexts are processed in parallel substantially simultaneously.

### Claim 5 (depends on 1)

The method as recited in claim 1 wherein potential and exact pattern matching includes scheduling and pipeline processing.

### Claim 6 (depends on 1)

The method as recited in claim 1 wherein the matching is performed by a pattern matching engine comprising a rake engine to determine potential matches and a ruler engine to determine exact matches.

### Claim 7

A method for matching an incoming data stream in the form of IP packets to a database of known signatures stored in memory, the method comprising:
identifying a flow associated with the IP packet being scanned;
retrieving state information related to the particular flow;
determining, by using the state information and the IP packet being scanned, whether the context has any potential pattern matches in the database of known signatures; and
determining, when a potential pattern match has been identified, whether the context has an exact pattern match from the potential pattern match;
determining a conclusion based on the results of the scan.

### Claim 8 (depends on 7)

The method as recited in claim 7 further comprising updating state information based on the results of the scanning.

### Claim 9 (depends on 7)

The method as recited in claim 7 wherein pattern matching occurs at least one IP packet boundary.

### Claim 10 (depends on 7)

The method as recited in claim 7 wherein after identifying the method includes breaking the incoming data stream into at least one fixed length context

### Claim 11 (depends on 7)

The method as recited in claim 7 wherein multiple contexts are processed in parallel substantially simultaneously.

### Claim 12 (depends on 7)

The method as recited in claim 7 wherein potential and exact pattern matching includes scheduling and pipeline processing.

### Claim 13 (depends on 7)

The method as recited in claim 7 wherein the matching is performed by a pattern matching engine comprising a rake engine to determine potential matches and a ruler engine to determine exact matches.
