Issue No. 03 - March (1981 vol. 30)

ISSN: 0018-9340

pp: 182-190

T. Ibaraki , Department of Applied Mathematics and Physics, Kyoto University

ABSTRACT

Consider a network which can be represented by an acyclic directed graph such that the links represented by the edges are subject to failure. Under the assumption that at most one link can fail at any time, we want to locate a failed link, if any, by means of certain tests. A test is performed by injecting a signal at a vertex and monitoring it at another vertex and can reveal if there is a failed link on any path between the two vertices. We want to find a minimal set of tests that can uniquely locate any single fault. Since this problem is in general NP-complete, we investigate a special case where the given network has a tree structure. We present an algorithm whose worst case running time can be bounded by a linear function of the input size.

INDEX TERMS

tree, Algorithm, complexity, diagnosis, network diagnosis, NP-complete, system graph, test

CITATION

T. Kameda, S. Toida, T. Ibaraki, "On Minimal Test Sets for Locating Single Link Failures in Networks",

*IEEE Transactions on Computers*, vol. 30, no. , pp. 182-190, March 1981, doi:10.1109/TC.1981.1675754