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.
| Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/6722 |
| Date | 11 August 2003 |
| Creators | Beal, Jacob |
| Source Sets | M.I.T. Theses and Dissertation |
| Language | en_US |
| Detected Language | English |
| Format | 9 p., 2144454 bytes, 705176 bytes, application/postscript, application/pdf |
| Relation | AIM-2003-017 |
Page generated in 0.0022 seconds