Advanced Search
DSpace@MIT

Near-Optimal Distributed Failure Circumscription

Research and Teaching Output of the MIT Community

Show simple item record

dc.contributor.author Beal, Jacob
dc.date.accessioned 2005-12-19T22:49:01Z
dc.date.available 2005-12-19T22:49:01Z
dc.date.issued 2003-08-11
dc.identifier.other MIT-CSAIL-TR-2003-009
dc.identifier.other AIM-2003-017
dc.identifier.uri http://hdl.handle.net/1721.1/30404
dc.description.abstract 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.
dc.format.extent 9 p.
dc.format.extent 13236751 bytes
dc.format.extent 840133 bytes
dc.format.mimetype application/postscript
dc.format.mimetype application/pdf
dc.language.iso en_US
dc.relation.ispartofseries Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory
dc.subject AI
dc.subject amorphous distributed ad-hoc computing self-organizing stopping failure
dc.title Near-Optimal Distributed Failure Circumscription


Files in this item

Name Size Format Description
MIT-CSAIL-TR-2003 ... 12.62Mb Postscript

Files in this item

Name Size Format Description
MIT-CSAIL-TR-2003 ... 820.4Kb PDF

This item appears in the following Collection(s)

Show simple item record

MIT-Mirage