Near-Optimal Distributed Failure Circumscription

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 i...

Full description

Bibliographic Details
Main Author: Beal, Jacob
Language:en_US
Published: 2004
Subjects:
Online Access:http://hdl.handle.net/1721.1/6722
_version_ 1811079657152315392
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 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.
first_indexed 2024-09-23T11:18:35Z
id mit-1721.1/6722
institution Massachusetts Institute of Technology
language en_US
last_indexed 2024-09-23T11:18:35Z
publishDate 2004
record_format dspace
spelling mit-1721.1/67222019-04-12T08:32:12Z 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 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. 2004-10-08T20:39:04Z 2004-10-08T20:39:04Z 2003-08-11 AIM-2003-017 http://hdl.handle.net/1721.1/6722 en_US AIM-2003-017 9 p. 2144454 bytes 705176 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/6722
work_keys_str_mv AT bealjacob nearoptimaldistributedfailurecircumscription