NOMS 2022-2022 IEEE/IFIP Network Operations and Management Symposium 2022
DOI: 10.1109/noms54207.2022.9789837
|View full text |Cite
|
Sign up to set email alerts
|

Exploiting Functional Connectivity Inference for Efficient Root Cause Analysis

Abstract: A crucial step in remedying faults within network infrastructure is to determine their root cause. However, the large-scale, complex and dynamic nature of modern architecture makes root cause analysis challenging. Statistical approaches for causal inference are promising, however, their deployment has been historically limited due to their high time complexity. In this paper we propose a general framework for leveraging the concept of functional connectivity to reduce the computational overhead of causal infer… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 14 publications
0
2
0
Order By: Relevance
“…2A and 2B demonstrate that both PC and THP exhibit exponential time complexity, with THP revealing a markedly large computational overhead, taking 61hrs to complete on only a network size of 200 nodes. 1 However, by exploiting the prior knowledge provided by the FC inference, the computational overhead of both algorithms was reduced. This reduction was more pronounced for THP, decreasing the processing time on the largest network by a factor 200, from 61hrs to 900s on a network of 200 nodes.…”
Section: A Stationary Synthetic Datamentioning
confidence: 99%
See 1 more Smart Citation
“…2A and 2B demonstrate that both PC and THP exhibit exponential time complexity, with THP revealing a markedly large computational overhead, taking 61hrs to complete on only a network size of 200 nodes. 1 However, by exploiting the prior knowledge provided by the FC inference, the computational overhead of both algorithms was reduced. This reduction was more pronounced for THP, decreasing the processing time on the largest network by a factor 200, from 61hrs to 900s on a network of 200 nodes.…”
Section: A Stationary Synthetic Datamentioning
confidence: 99%
“…This research was funded by Moogsoft Ltd. and describes patented features of its product.An early iteration of the framework was discussed in our Network Operations and Management Symposium poster[1].…”
mentioning
confidence: 99%