Near-Optimal Distributed Failure Circumscription
Jacob Beal · DSpace@MIT (Massachusetts Institute of Technology) · 2003
Small failures should only disrupt a small part of a network. One wayto do this is by marking the surrounding area as untrustworthy ---circumscribing the failure. This can be done with a distributedalgorithm using hierarchical clustering and neighbor relations, andthe resulting circumscription is near-optimal for convex failures.