Non-deterministic finite automata tree structure application apparatus and method
US12040945B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Oct 20, 2021 |
| Grant date | Jul 16, 2024 |
| Priority date | — |
| Expiry date | Jan 17, 2043 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04W48/18
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A method includes processing event data to detect a status of a network function. The event data is processed based on two or more conditions defined by a correlation policy. The correlation policy includes a non-deterministic finite automata tree (NFAT) structure correlation policy having a policy type. The method also includes determining a first value of a first condition of the two or more conditions. The method further includes determining a second value of a second condition of the two or more conditions. The method additionally includes determining the policy type of the NFAT structure correlation policy. The method also includes determining whether the first value is greater than a first preset value indicative of whether the first condition is satisfied. The method further includes determining whether the second value is greater than a second preset value indicative of whether the second condition is satisfied.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.