Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Accuracy vs. efficiency trade-offs in probabilistic diagnosis
Eighteenth national conference on Artificial intelligence
Research challenges of autonomic computing
Proceedings of the 27th international conference on Software engineering
FRACTAL: efficient fault isolation using active testing
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Efficient active probing for fault diagnosis in large scale and noisy networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
A model-based active testing approach to sequential diagnosis
Journal of Artificial Intelligence Research
Approximations for explanations of inconsistency in partially known multi-context systems
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Fast extraction of adaptive change point based patterns for problem resolution in enterprise systems
DSOM'06 Proceedings of the 17th IFIP/IEEE international conference on Distributed Systems: operations and management
Efficient probe selection for fault localization using the property of submodularity
International Journal of Communication Systems
| Hi-index | 0.00 |
We address the task of problem determination in a distributed system using probes, or test transactions, which gather information about system components. Effective probing requires minimizing the cost of probing while maximizing the diagnostic accuracy of the probe set. We show that pre-planning an optimal probe set is NP-hard and present polynomial-time approximation algorithms that perform well. We then implement an active probing strategy which selects probes dynamically and show that it yields a significant reduction in probe set size in both simulation and a real system environment.