| dc.date.accessioned | 2004-10-08T20:39:04Z | |
| dc.date.accessioned | 2018-11-24T10:21:40Z | |
| dc.date.available | 2004-10-08T20:39:04Z | |
| dc.date.available | 2018-11-24T10:21:40Z | |
| dc.date.issued | 2003-08-11 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/6722 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/6722 | |
| dc.description.abstract | 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. | en_US |
| dc.format.extent | 9 p. | en_US |
| dc.format.extent | 2144454 bytes | |
| dc.format.extent | 705176 bytes | |
| dc.language.iso | en_US | |
| dc.subject | AI | en_US |
| dc.subject | amorphous distributed ad-hoc computing self-organizing stopping failure | en_US |
| dc.title | Near-Optimal Distributed Failure Circumscription | en_US |
