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...
Main Author: | Beal, Jacob |
---|---|
Language: | en_US |
Published: |
2004
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/6722 |
Similar Items
-
Near-Optimal Distributed Failure Circumscription
by: Beal, Jacob
Published: (2005) -
Leaderless Distributed Hierarchy Formation
by: Beal, Jacob
Published: (2004) -
RamboNodes for the Metropolitan Ad Hoc Network
by: Beal, Jacob, et al.
Published: (2004) -
RamboNodes for the Metropolitan Ad Hoc Network
by: Beal, Jacob, et al.
Published: (2005) -
Persistent Nodes for Reliable Memory in Geographically Local Networks
by: Beal, Jacob
Published: (2004)