Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Communications of the ACM
Schemes for fault identification in communication networks
IEEE/ACM Transactions on Networking (TON)
Proceedings of the fourth international symposium on Integrated network management IV
Proceedings of the fourth international symposium on Integrated network management IV
A coding approach to event correlation
Proceedings of the fourth international symposium on Integrated network management IV
A Probabilistic Approach to Fault Diagnosis in Linear Lightwave Networks
Proceedings of the IFIP TC6/WG6.6 Third International Symposium on Integrated Network Management with participation of the IEEE Communications Society CNOM and with support from the Institute for Educational Services
BRITE: Universal Topology Generation from a User''s Perspective
BRITE: Universal Topology Generation from a User''s Perspective
High speed and robust event correlation
IEEE Communications Magazine
Probabilistic fault diagnosis in communication systems through incremental hypothesis updating
Computer Networks: The International Journal of Computer and Telecommunications Networking
Probabilistic fault localization in communication systems using belief networks
IEEE/ACM Transactions on Networking (TON)
Principle Components and Importance Ranking of Distributed Anomalies
Machine Learning
Probabilistic anomaly detection in distributed computer networks
Science of Computer Programming
| Hi-index | 0.00 |
Probabilistic inference was shown effective in non-deterministic diagnosis of end-to-end service failures. To overcome the exponential complexity of the exact inference algorithms in fault propagation models represented by graphs with undirected loops, Pearl's iterative algorithms for polytrees were used as an approximation schema. The approximation made it possible to diagnose end-to-end service failures in network topologies composed of tens of nodes. This paper proposes a distributed algorithm that increases the admissible network size by an order of magnitude. The algorithm divides the computational effort and system knowledge among multiple, hierarchically organized managers. The cooperation among managers is illustrated with examples, and the results of a preliminary performance study are presented.