AUTOMATIC ROOT CAUSE DIAGNOSIS IN NETWORKS BASED ON HYPOTHESIS TESTING

An embodiment may involve obtaining a set of data records including features characterizing operational aspects of a communication network. Each data record may include a feature vector and performance metrics of the communication network. Each feature vector may include a multiple elements correspo...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: NADEAU, Sylvain, MDINI, Maha, WHATLEY, Justin
Format: Patent
Sprache:eng ; fre ; ger
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 NADEAU, Sylvain
MDINI, Maha
WHATLEY, Justin
description An embodiment may involve obtaining a set of data records including features characterizing operational aspects of a communication network. Each data record may include a feature vector and performance metrics of the communication network. Each feature vector may include a multiple elements corresponding to feature-value pairs. A first statistical analysis may be applied to the set of data records and their performance metrics to identify major contributors to degraded network performance. A second statistical analysis may be applied to identify elements that negatively influence the major contributors, and to discriminate between additive effects and incompatibilities as the source of negative influence. For each major contributor, a hierarchical dependency tree may be constructed with the major contributor as the root node and influencer elements as other nodes. Redundant dependencies may be removed, mutually dependent influencer elements grouped, and only the longest edges retained, in order to create dependency graph.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_EP3764592B1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EP3764592B1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_EP3764592B13</originalsourceid><addsrcrecordid>eNrjZHBzDA3x93UM8XRWCPL3D1FwdgwNdlVw8XR09_MP9gxW8PRT8HMNCfcP8g5WcHIMdnVR8PdT8IgM8A_xcAXJh7gGh3j6ufMwsKYl5hSn8kJpbgYFN9cQZw_d1IL8-NTigsTk1LzUknjXAGNzMxNTSyMnQ2MilAAAdXgsOg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>AUTOMATIC ROOT CAUSE DIAGNOSIS IN NETWORKS BASED ON HYPOTHESIS TESTING</title><source>esp@cenet</source><creator>NADEAU, Sylvain ; MDINI, Maha ; WHATLEY, Justin</creator><creatorcontrib>NADEAU, Sylvain ; MDINI, Maha ; WHATLEY, Justin</creatorcontrib><description>An embodiment may involve obtaining a set of data records including features characterizing operational aspects of a communication network. Each data record may include a feature vector and performance metrics of the communication network. Each feature vector may include a multiple elements corresponding to feature-value pairs. A first statistical analysis may be applied to the set of data records and their performance metrics to identify major contributors to degraded network performance. A second statistical analysis may be applied to identify elements that negatively influence the major contributors, and to discriminate between additive effects and incompatibilities as the source of negative influence. For each major contributor, a hierarchical dependency tree may be constructed with the major contributor as the root node and influencer elements as other nodes. Redundant dependencies may be removed, mutually dependent influencer elements grouped, and only the longest edges retained, in order to create dependency graph.</description><language>eng ; fre ; ger</language><creationdate>2022</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=20220316&amp;DB=EPODOC&amp;CC=EP&amp;NR=3764592B1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25562,76317</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20220316&amp;DB=EPODOC&amp;CC=EP&amp;NR=3764592B1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>NADEAU, Sylvain</creatorcontrib><creatorcontrib>MDINI, Maha</creatorcontrib><creatorcontrib>WHATLEY, Justin</creatorcontrib><title>AUTOMATIC ROOT CAUSE DIAGNOSIS IN NETWORKS BASED ON HYPOTHESIS TESTING</title><description>An embodiment may involve obtaining a set of data records including features characterizing operational aspects of a communication network. Each data record may include a feature vector and performance metrics of the communication network. Each feature vector may include a multiple elements corresponding to feature-value pairs. A first statistical analysis may be applied to the set of data records and their performance metrics to identify major contributors to degraded network performance. A second statistical analysis may be applied to identify elements that negatively influence the major contributors, and to discriminate between additive effects and incompatibilities as the source of negative influence. For each major contributor, a hierarchical dependency tree may be constructed with the major contributor as the root node and influencer elements as other nodes. Redundant dependencies may be removed, mutually dependent influencer elements grouped, and only the longest edges retained, in order to create dependency graph.</description><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2022</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZHBzDA3x93UM8XRWCPL3D1FwdgwNdlVw8XR09_MP9gxW8PRT8HMNCfcP8g5WcHIMdnVR8PdT8IgM8A_xcAXJh7gGh3j6ufMwsKYl5hSn8kJpbgYFN9cQZw_d1IL8-NTigsTk1LzUknjXAGNzMxNTSyMnQ2MilAAAdXgsOg</recordid><startdate>20220316</startdate><enddate>20220316</enddate><creator>NADEAU, Sylvain</creator><creator>MDINI, Maha</creator><creator>WHATLEY, Justin</creator><scope>EVB</scope></search><sort><creationdate>20220316</creationdate><title>AUTOMATIC ROOT CAUSE DIAGNOSIS IN NETWORKS BASED ON HYPOTHESIS TESTING</title><author>NADEAU, Sylvain ; MDINI, Maha ; WHATLEY, Justin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_EP3764592B13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng ; fre ; ger</language><creationdate>2022</creationdate><toplevel>online_resources</toplevel><creatorcontrib>NADEAU, Sylvain</creatorcontrib><creatorcontrib>MDINI, Maha</creatorcontrib><creatorcontrib>WHATLEY, Justin</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>NADEAU, Sylvain</au><au>MDINI, Maha</au><au>WHATLEY, Justin</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>AUTOMATIC ROOT CAUSE DIAGNOSIS IN NETWORKS BASED ON HYPOTHESIS TESTING</title><date>2022-03-16</date><risdate>2022</risdate><abstract>An embodiment may involve obtaining a set of data records including features characterizing operational aspects of a communication network. Each data record may include a feature vector and performance metrics of the communication network. Each feature vector may include a multiple elements corresponding to feature-value pairs. A first statistical analysis may be applied to the set of data records and their performance metrics to identify major contributors to degraded network performance. A second statistical analysis may be applied to identify elements that negatively influence the major contributors, and to discriminate between additive effects and incompatibilities as the source of negative influence. For each major contributor, a hierarchical dependency tree may be constructed with the major contributor as the root node and influencer elements as other nodes. Redundant dependencies may be removed, mutually dependent influencer elements grouped, and only the longest edges retained, in order to create dependency graph.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng ; fre ; ger
recordid cdi_epo_espacenet_EP3764592B1
source esp@cenet
title AUTOMATIC ROOT CAUSE DIAGNOSIS IN NETWORKS BASED ON HYPOTHESIS TESTING
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-14T04%3A12%3A39IST&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=NADEAU,%20Sylvain&rft.date=2022-03-16&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EEP3764592B1%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