Active Probing Strategies for Problem Diagnosis in Distributed Systems
Abstract
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. 1
Cite
Text
Brodie et al. "Active Probing Strategies for Problem Diagnosis in Distributed Systems." International Joint Conference on Artificial Intelligence, 2003.Markdown
[Brodie et al. "Active Probing Strategies for Problem Diagnosis in Distributed Systems." International Joint Conference on Artificial Intelligence, 2003.](https://mlanthology.org/ijcai/2003/brodie2003ijcai-active/)BibTeX
@inproceedings{brodie2003ijcai-active,
title = {{Active Probing Strategies for Problem Diagnosis in Distributed Systems}},
author = {Brodie, Mark and Rish, Irina and Ma, Sheng and Odintsova, Natalia},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2003},
pages = {1337-1338},
url = {https://mlanthology.org/ijcai/2003/brodie2003ijcai-active/}
}