CSAIL Event Calendar: Previous Series
Near-Optimal Distributed Failure Circumscription
Speaker: Jake Beal , CSAIL
Small failures should only disrupt a small part of a network. 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 circumscription is near-optimal for convex failures.