Near-Optimal Distributed Failure Circumscription
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 n...
| Main Author: | |
|---|---|
| Language: | en_US |
| Published: |
2005
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/30404 |
| _version_ | 1826209234926174208 |
|---|---|
| author | Beal, Jacob |
| author_facet | Beal, Jacob |
| author_sort | Beal, Jacob |
| collection | MIT |
| description | 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. |
| first_indexed | 2024-09-23T14:19:19Z |
| id | mit-1721.1/30404 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T14:19:19Z |
| publishDate | 2005 |
| record_format | dspace |
| spelling | mit-1721.1/304042019-04-12T08:26:01Z Near-Optimal Distributed Failure Circumscription Beal, Jacob AI amorphous distributed ad-hoc computing self-organizing stopping failure 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. 2005-12-19T22:49:01Z 2005-12-19T22:49:01Z 2003-08-11 MIT-CSAIL-TR-2003-009 AIM-2003-017 http://hdl.handle.net/1721.1/30404 en_US Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory 9 p. 13236751 bytes 840133 bytes application/postscript application/pdf application/postscript application/pdf |
| spellingShingle | AI amorphous distributed ad-hoc computing self-organizing stopping failure Beal, Jacob Near-Optimal Distributed Failure Circumscription |
| title | Near-Optimal Distributed Failure Circumscription |
| title_full | Near-Optimal Distributed Failure Circumscription |
| title_fullStr | Near-Optimal Distributed Failure Circumscription |
| title_full_unstemmed | Near-Optimal Distributed Failure Circumscription |
| title_short | Near-Optimal Distributed Failure Circumscription |
| title_sort | near optimal distributed failure circumscription |
| topic | AI amorphous distributed ad-hoc computing self-organizing stopping failure |
| url | http://hdl.handle.net/1721.1/30404 |
| work_keys_str_mv | AT bealjacob nearoptimaldistributedfailurecircumscription |