Non-deterministic finite automata tree structure application apparatus and method

Non-deterministic finite automata tree structure application apparatus and method

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Rathinam, Bharath, Atri, Rahul, Lamba, Surender Singh, Sharma, Abhishek, Dixit, Mihirraj Narendra
Format: Patent
Sprache:eng
Schlagworte:
ELECTRIC COMMUNICATION TECHNIQUE
ELECTRICITY
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
WIRELESS COMMUNICATIONS NETWORKS
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Rathinam, Bharath
Atri, Rahul
Lamba, Surender Singh
Sharma, Abhishek
Dixit, Mihirraj Narendra
description 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.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US12040945B2</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US12040945B2</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US12040945B23</originalsourceid><addsrcrecordid>eNqNik0KwjAUBrNxIdU7PA9QqLUu3CoVV4Ko6_JIXmmg-SH5cn8reABXMwyzVo978LURSHLW2wyraVwEQlwQHIMJSYQyUtEoaekxzlYzbPBf58QomdgbcoIpmI1ajTxn2f5Yqd21f11utcQwSI6sxQuG93PfNl1z6o7n9vDP8wFWOTi_</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Non-deterministic finite automata tree structure application apparatus and method</title><source>esp@cenet</source><creator>Rathinam, Bharath ; Atri, Rahul ; Lamba, Surender Singh ; Sharma, Abhishek ; Dixit, Mihirraj Narendra</creator><creatorcontrib>Rathinam, Bharath ; Atri, Rahul ; Lamba, Surender Singh ; Sharma, Abhishek ; Dixit, Mihirraj Narendra</creatorcontrib><description>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.</description><language>eng</language><subject>ELECTRIC COMMUNICATION TECHNIQUE ; ELECTRICITY ; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION ; WIRELESS COMMUNICATIONS NETWORKS</subject><creationdate>2024</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20240716&amp;DB=EPODOC&amp;CC=US&amp;NR=12040945B2$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25542,76289</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20240716&amp;DB=EPODOC&amp;CC=US&amp;NR=12040945B2$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Rathinam, Bharath</creatorcontrib><creatorcontrib>Atri, Rahul</creatorcontrib><creatorcontrib>Lamba, Surender Singh</creatorcontrib><creatorcontrib>Sharma, Abhishek</creatorcontrib><creatorcontrib>Dixit, Mihirraj Narendra</creatorcontrib><title>Non-deterministic finite automata tree structure application apparatus and method</title><description>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.</description><subject>ELECTRIC COMMUNICATION TECHNIQUE</subject><subject>ELECTRICITY</subject><subject>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><subject>WIRELESS COMMUNICATIONS NETWORKS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2024</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqNik0KwjAUBrNxIdU7PA9QqLUu3CoVV4Ko6_JIXmmg-SH5cn8reABXMwyzVo978LURSHLW2wyraVwEQlwQHIMJSYQyUtEoaekxzlYzbPBf58QomdgbcoIpmI1ajTxn2f5Yqd21f11utcQwSI6sxQuG93PfNl1z6o7n9vDP8wFWOTi_</recordid><startdate>20240716</startdate><enddate>20240716</enddate><creator>Rathinam, Bharath</creator><creator>Atri, Rahul</creator><creator>Lamba, Surender Singh</creator><creator>Sharma, Abhishek</creator><creator>Dixit, Mihirraj Narendra</creator><scope>EVB</scope></search><sort><creationdate>20240716</creationdate><title>Non-deterministic finite automata tree structure application apparatus and method</title><author>Rathinam, Bharath ; Atri, Rahul ; Lamba, Surender Singh ; Sharma, Abhishek ; Dixit, Mihirraj Narendra</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US12040945B23</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2024</creationdate><topic>ELECTRIC COMMUNICATION TECHNIQUE</topic><topic>ELECTRICITY</topic><topic>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</topic><topic>WIRELESS COMMUNICATIONS NETWORKS</topic><toplevel>online_resources</toplevel><creatorcontrib>Rathinam, Bharath</creatorcontrib><creatorcontrib>Atri, Rahul</creatorcontrib><creatorcontrib>Lamba, Surender Singh</creatorcontrib><creatorcontrib>Sharma, Abhishek</creatorcontrib><creatorcontrib>Dixit, Mihirraj Narendra</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Rathinam, Bharath</au><au>Atri, Rahul</au><au>Lamba, Surender Singh</au><au>Sharma, Abhishek</au><au>Dixit, Mihirraj Narendra</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Non-deterministic finite automata tree structure application apparatus and method</title><date>2024-07-16</date><risdate>2024</risdate><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.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US12040945B2
source esp@cenet
subjects ELECTRIC COMMUNICATION TECHNIQUE
ELECTRICITY
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
WIRELESS COMMUNICATIONS NETWORKS
title Non-deterministic finite automata tree structure application apparatus and method
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-06T06%3A44%3A26IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=Rathinam,%20Bharath&rft.date=2024-07-16&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS12040945B2%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true