| dc.creator |
Beal, Jacob |
|
| dc.date |
2004-10-08T20:39:04Z |
|
| dc.date |
2004-10-08T20:39:04Z |
|
| dc.date |
2003-08-11 |
|
| dc.date.accessioned |
2013-10-09T02:46:33Z |
|
| dc.date.available |
2013-10-09T02:46:33Z |
|
| dc.date.issued |
2013-10-09 |
|
| dc.identifier |
AIM-2003-017 |
|
| dc.identifier |
http://hdl.handle.net/1721.1/6722 |
|
| dc.identifier.uri |
http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
|
| dc.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. |
|
| dc.format |
9 p. |
|
| dc.format |
2144454 bytes |
|
| dc.format |
705176 bytes |
|
| dc.format |
application/postscript |
|
| dc.format |
application/pdf |
|
| dc.language |
en_US |
|
| dc.relation |
AIM-2003-017 |
|
| dc.subject |
AI |
|
| dc.subject |
amorphous distributed ad-hoc computing self-organizing stopping failure |
|
| dc.title |
Near-Optimal Distributed Failure Circumscription |
|