Asynchronous failure location algorithm for fiber-optic networks

All current research on fiber-optic networks assume that the underlying fiber-optic network delivers the messages correctly to their intended destination. To satisfy the assumption of correct delivery of messages, we present an algorithm that locates possible stuck-at faults in the switching subsystems of the nodes of general asynchronous fiber-optic networks and provides the nodes of such a network with reliable paths for delivering messages sent between any two nodes. The algorithm has an O(n/sup 2/E) message complexity and O(Elog/sub 2/n+mnlog/sub 2/n) bit storage complexity, where n, E, and m are the total number of nodes, the total number of edges, and the maximum degree of the network, respectively.