.png){kind=icon}
.png){kind=icon}
Return
Parallelizing Under-Determined Inverse Problems for Network Applications
.png){kind=icon}
OA
AI
DOI：10.1109/TETCI.2016.2635129.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we introduce a new technique for partitioning a large-scale under-determined linear inverse problem into multiple smaller subproblems that can be efficiently solved independently. and in parallel. When it is impossible or inefficient to solve a large-scale under-determined linear inverse problem, this technique can be used to significantly speed up the computation process without compromising the accuracy of the solution. We present numerical results that show the effectiveness of this approach when applied to network inference problems including traffic matrix estimation and network anomaly detection, both are important for managing large, complex networks and cyber security. Our proposed framework is applicable to other emerging applications in computational intelligence that can be formulated as wider determined linear inverse problems.
Keywords:
Anomaly detection
network measurement and inference
traffic matrix estimation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
6.5
Papers:
1.4K
Citations:
4.5K
