Processing of Finite Automata Based on a Node Cache
US-2015295891-A1 · Oct 15, 2015 · US
System and method to traverse a non-deterministic finite automata (NFA) graph generated for regular expression patterns with advanced features
US9507563B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9507563-B2 |
| Application number | US-201414186913-A |
| Country | US |
| Kind code | B2 |
| Filing date | Feb 21, 2014 |
| Priority date | Aug 30, 2013 |
| Publication date | Nov 29, 2016 |
| Grant date | Nov 29, 2016 |
How to read this patent
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
- Title
What the patent document calls the invention.
- Abstract
A short plain-language summary of the technical disclosure.
- Assignees and inventors
Who owns or filed the patent and who is credited as inventor.
- Key dates
Filing, priority, publication, and grant dates set the timeline.
- First independent claim
The legal scope of protection — read this for what is actually claimed.
- CPC / IPC classifications
Technology tags used to group this patent with similar filings.
- Citations and related patents
Prior art links and similar publications in this corpus.
Abstract
Official abstract text for this publication.
In one embodiment, a method of walking a non-deterministic finite automata (NFA) graph representing a pattern includes extracting a node type and an element from a node of the NFA graph. The method further includes matching a segment of a payload for the element by matching the payload for the element at least zero times, the number of times based on the node type.
First claim
Opening claim text (preview).
What is claimed is: 1. A method of walking a non-deterministic finite automata (NFA) graph representing a pattern, the method comprising: by a processor, extracting a node type, a next node address, and an element from a node of the NFA graph; and by the processor, matching a segment of a payload with the element by matching the payload with the element at least zero times, a number of the at least zero times based on the node type, wherein extracting the node type, next node ad…
Assignees
Inventors
Classifications
Physics · mapped topic
Physics · mapped topic
Physics · mapped topic
- H04L63/1408Primary
Electricity · mapped topic
- G06F13/28Primary
Physics · mapped topic
Patent family
Related publications grouped by family.
External sources
Next steps
Free tools are coming soon. Tell us what you want to track and we'll notify you.
Frequently asked questions
Answers are generated from the same data shown on this page.
- What does patent US9507563B2 cover?
- In one embodiment, a method of walking a non-deterministic finite automata (NFA) graph representing a pattern includes extracting a node type and an element from a node of the NFA graph. The method further includes matching a segment of a payload for the element by matching the payload for the element at least zero times, the number of times based on the node type.
- Who is the assignee on this patent?
- Cavium Inc
- What technology area does this patent fall under?
- Primary CPC classification H04L63/1408. Mapped technology areas include Electricity.
- When was this patent published?
- Publication date Tue Nov 29 2016 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
- What related patents are in patentsdb?
- We list 12 related publications on this page (citations in our corpus or others sharing the same primary CPC).