Near-optimal Distributed Failure Circumscription

J. Beal (USA)


Amorphous Computing, Distributed Failure Circumscription


Small failures should only disrupt a small part of a net work. One way to do this is by marking the surrounding area as untrustworthy -- circumscribing the failure. This can be done with a distributed algorithm using hierarchical clustering and neighbor relations, and the resulting circum scription is near-optimal for convex failures.

Important Links:

Go Back