# US 2005/0238010 A1 · Programmable packet parsing processor

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

- Number: US 2005/0238010 A1
- Document ID: US20050238010A1
- Status: Published application
- Kind: A1
- Application number: 10/832,796
- Filed: 2004-04-26
- Published: 2005-10-27
- Earliest claimed: 2004-04-26
- Assignees: Cisco Technology, Inc.
- Inventors: Rina Panigrahy; Jackie Liu; Daniel Ng; Sanjay Jain; Nagaraj Bagepalli; Abhijit Patra
- Web page: https://patentgrep.com/patent/US20050238010A1

## CPC

- H04L 63/0254: {Stateful filtering}
- H04L 63/1408: {by monitoring network traffic (monitoring network traffic per se H04L43/00)}
- H04L 69/22: Parsing or analysis of headers
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

The present invention provides a packet processing device and method. A parsing processor provides instruction-driven content inspection of network packets at 10-Gbps and above with a parsing engine that executes parsing instructions. A flow state unit maintains statefulness of packet flows to allow content inspection across several related network packets. A state-graph unit traces state-graph nodes to keyword indications and/or parsing instructions. The parsing instructions can be derived from a high-level application to emulate user-friendly parsing logic. The parsing processor sends parsed packets to a network processor unit for further processing.

## Claims

### Claim 1

A packet parsing processor, comprising:
a parsing engine having an input to receive a signal that represents a network packet, the parsing engine to perform instruction-driven packet parsing on the packet responsive to parsing instructions; and
a state-graph unit having an input/output coupled to a second input/output of the parsing engine, the state-graph unit to store the parsing instructions.

### Claim 2 (depends on 1)

The packet processor of claim 1, wherein the parsing engine further comprises a hash unit store a portion of a parsing state, and wherein the parsing engine generates a key to look-up the portion of the parsing state.

### Claim 3 (depends on 2)

The packet processor of claim 2, wherein the hash table comprises a TCP (Transmission Control Protocol) flow table and the key comprises a destination IP (Internet Protocol) address and destination port.

### Claim 4 (depends on 1)

The packet processor of claim 1, wherein the parsing engine further comprises a plurality of scratchpads to store data while executing parsing instructions.

### Claim 5 (depends on 1)

The packet processor of claim 1, wherein a parsing instruction is associated with a node in the state-graph, the parsing engine executing the parsing instruction responsive to a node match.

### Claim 6 (depends on 1)

The packet processor of claim 1, wherein a portion of the parsing instructions emulate nodes from a software application for application recognition.

### Claim 7 (depends on 1)

The packet processor of claim 1, wherein a parsing instruction comprises an encoded bitmap that represents whether characters have a transition.

### Claim 8 (depends on 1)

The packet processor of claim 1, wherein the state-graph unit comprises an FCRAM (Fast Cycle Random Access Memory).

### Claim 9 (depends on 1)

The packet processor of claim 1, wherein the parsing engine further comprises a plurality of processing cores to execute parsing instructions.

### Claim 10 (depends on 1)

The packet processor of claim 1, further comprising a flow state unit having an input/output coupled to a first input/output of the parsing engine, the flow state unit to maintain a parse state across a packet flow.

### Claim 11 (depends on 10)

The packet processor of claim 10, wherein the parsing engine stores the parser state in the flow state unit after parsing the network packet.

### Claim 12 (depends on 1)

The packet processor of claim 1, wherein the packet processor is contained within a network device, coupled to a network operating at 10-Gbps or above, network device performing one from the group containing: data packet routing, data packet forwarding, data packet bridging.

### Claim 13 (depends on 1)

A packet parsing processor of claim 1, wherein the packet parsing supports one from the group containing: intrusion detection, quality of service, application recognition, virus detection, and an application-level firewall.

### Claim 14

A packet parsing processor, comprising:
means for parsing a network packet responsive to parsing instructions; and
means for graphing, coupled to the means for regular expression matching, the means for graphing identifying keyword matches between a state-graph and the network packet.

### Claim 15 (depends on 14)

The packet processor of claim 14, wherein the means for parsing further comprises a means for hashing to store a parsing state, and the means for parsing generates a key to look-up a portion of the parsing state.

### Claim 16 (depends on 15)

The packet processor of claim 15, wherein the means for hashing comprises a TCP (Transmission Control Protocol) hash table and the key comprises a destination IP (Internet Protocol) address and destination port.

### Claim 17 (depends on 14)

The packet processor of claim 14, wherein the means for regular expression matching further comprises a plurality of means for storing data while executing parsing instructions.

### Claim 18 (depends on 14)

The packet processor of claim 14, wherein a parsing instruction is associated with a node in the state-graph, the means for regular expression matching executing the parsing instruction responsive to a node match.

### Claim 19 (depends on 1)

The packet processor of claim 1, wherein a portion of the parsing instructions emulate nodes from a software application for application recognition.

### Claim 20 (depends on 14)

The packet processor of claim 14, wherein a parsing instruction comprises an encoded bitmap that represents whether characters have a transition.

### Claim 21 (depends on 14)

The packet processor of claim 14, wherein the means for regular expression matching further comprises a plurality of means for executing parsing instructions.

### Claim 22 (depends on 14)

The packet processor of claim 14, further comprising means for maintaining, coupled to the means for regular expression matching, the means for maintaining storing parse states for a plurality of packet flows

### Claim 23 (depends on 14)

The packet processor of claim 14, wherein the means for regular expression matching stores the parser state in the means for maintaining after parsing the network packet.

### Claim 24

A method of parsing packets in a processor, comprising:
receiving a network packet,
performing instruction-driven packet parsing on the network packet responsive to parsing instructions that traverse nodes of a state machine; and
storing parsing instructions in memory addresses corresponding to the nodes.

### Claim 25 (depends on 24)

The method of claim 24, wherein the performing instruction-driven packet parsing further storing a portion of a parsing state in a hash unit, and generating a key to look-up the portion of the parsing state.

### Claim 26 (depends on 25)

The packet processor of claim 25, wherein the hash table comprises a TCP (Transmission Control Protocol) hash table and the key comprises a destination IP (Internet Protocol) address and destination port.

### Claim 27 (depends on 24)

The method of claim 24, wherein the performing instruction-driven packet parsing further comprises executing parsing instructions in scratchpads.

### Claim 28 (depends on 24)

The method of claim 24, further comprising:
maintaining parse states for a plurality of packet flows.

### Claim 29 (depends on 24)

The method of claim 24, wherein a parsing instruction is associated with a node in the state-graph, and identifying keyword matches further comprises identifying a parsing instruction at a node of the state graph, and executing the parsing instruction responsive to a node match.

### Claim 30 (depends on 24)

The method of claim 24, wherein a portion of the parsing instructions emulate nodes from a software application for application recognition

### Claim 31 (depends on 24)

The method of claim 24, wherein a parsing instruction comprises an encoded bitmap that represents whether characters have a transition.

### Claim 32 (depends on 24)

The method of claim 24, wherein the identifying keyword matches comprises identifying keyword matches on a state-graph stored in an FCRAM (Fast Cycle Random Access Memory).

### Claim 33 (depends on 24)

The method of claim 24, further comprising executing a parsing instruction.

### Claim 34 (depends on 24)

The method of claim 24, the maintaining the flow states further comprises storing the parser state after parsing the network packet.

### Claim 35

A computer program product, comprising a computer-readable medium having computer program instructions and data embodied thereon for parsing packets in a processor, comprising:
receiving a network packet,
performing instruction-driven packet parsing on the network packet responsive to parsing instructions that traverse nodes of a state machine; and
storing parsing instructions in memory addresses corresponding to the nodes.

### Claim 36 (depends on 35)

The computer program product of claim 35, wherein the performing instruction-driven packet parsing further storing a portion of a parsing state in a hash unit, and generating a key to look-up the portion of the parsing state.

### Claim 37 (depends on 36)

The computer program product of claim 36, wherein the hash table comprises a TCP (Transmission Control Protocol) hash table and the key comprises a destination IP (Internet Protocol) address and destination port.

### Claim 38 (depends on 35)

The computer program product of claim 35, wherein the performing instruction-driven packet parsing further comprises executing parsing instructions in scratchpads.

### Claim 39 (depends on 35)

The computer program product of claim 35, further comprising:
maintaining parse states for a plurality of packet flows.

### Claim 40 (depends on 35)

The computer program product of claim 35, wherein a parsing instruction is associated with a node in the state-graph, and identifying keyword matches further comprises identifying a parsing instruction at a node of the state graph, and executing the parsing instruction responsive to a node match.

### Claim 41 (depends on 35)

The computer program product of claim 35, wherein a portion of the parsing instructions emulate nodes from a software application for application recognition

### Claim 42 (depends on 35)

The computer program product of claim 35, wherein a parsing instruction comprises an encoded bitmap that represents whether characters have a transition.

### Claim 43 (depends on 35)

The computer program product of claim 35, wherein the identifying keyword matches comprises identifying keyword matches on a state-graph stored in an FCRAM (Fast Cycle Random Access Memory).

### Claim 44 (depends on 35)

The computer program product of claim 35, further comprising executing a parsing instruction.

### Claim 45 (depends on 35)

The computer program product of claim 35; the maintaining the flow states further comprises storing the parser state after parsing the network packet.
