Abstract:
This paper suggests a characterization of fault localization strategies and a classification of probability-based search algorithms, which are widely used in the current practice of complex computer systems and networks systems maintenance and service. The characterization is performed in terms of some tuples including: characteristics of fault models, localization procedures, cost functions, and other factors. Such characterization (and an induced classification) can be used for a rational choice of search algorithms at early system design stages, for development of strategies of possible fault localization during the target systems maintenance and service. Search algorithms classification is based on the special notation like those used in the queuing theory.