| Autor: |
Arrigoni, Viviana, Bartolini, Novella, Massini, Annalisa, Trombetti, Federico |
| Zdroj: |
IEEE/ACM Transactions on Networking; 2023, Vol. 31 Issue: 2 p770-783, 14p |
| Abstrakt: |
Boolean Network Tomography (BNT) aims at identifying failures of internal network components by means of end-to-end monitoring paths. However, when the number of failures is not known a priori, failure identification may require a huge number of monitoring paths. We address this problem by designing a Bayesian approach that progressively selects the next path to probe on the basis of its expected information utility, conditioned on prior observations. As the complexity of the computation of posterior probabilities of node failures is exponential in the number of failed paths, we propose a polynomial-time greedy strategy which approximates these values. To consider aging of information in dynamic failure scenarios where node states can change during a monitoring period, we propose a monitoring technique based on a sliding observation window of adaptive length. By means of numerical experiments conducted on real network topologies we demonstrate the practical applicability of our approach, and the superiority of our algorithms with respect to state of the art solutions based on classic BNT as well as sequential group testing. |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
