Leaderless Distributed Hierarchy Formation
I present a system for robust leaderless organization of an amorphous network into hierarchical clusters. This system, which assumes that nodes are spatially embedded and can only talk to neighbors within a given radius, scales to networks of arbitrary size and converges rapidly. The amount of d...
| Main Author: | |
|---|---|
| Language: | en_US |
| Published: |
2004
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/5933 |
| _version_ | 1826216194953183232 |
|---|---|
| author | Beal, Jacob |
| author_facet | Beal, Jacob |
| author_sort | Beal, Jacob |
| collection | MIT |
| description | I present a system for robust leaderless organization of an amorphous network into hierarchical clusters. This system, which assumes that nodes are spatially embedded and can only talk to neighbors within a given radius, scales to networks of arbitrary size and converges rapidly. The amount of data stored at each node is logarithmic in the diameter of the network, and the hierarchical structure produces an addressing scheme such that there is an invertible relation between distance and address for any pair of nodes. The system adapts automatically to stopping failures, network partition, and reorganization. |
| first_indexed | 2024-09-23T16:43:48Z |
| id | mit-1721.1/5933 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T16:43:48Z |
| publishDate | 2004 |
| record_format | dspace |
| spelling | mit-1721.1/59332019-04-10T17:24:21Z Leaderless Distributed Hierarchy Formation Beal, Jacob AI amorphous computing hierarchy leaderless distributed I present a system for robust leaderless organization of an amorphous network into hierarchical clusters. This system, which assumes that nodes are spatially embedded and can only talk to neighbors within a given radius, scales to networks of arbitrary size and converges rapidly. The amount of data stored at each node is logarithmic in the diameter of the network, and the hierarchical structure produces an addressing scheme such that there is an invertible relation between distance and address for any pair of nodes. The system adapts automatically to stopping failures, network partition, and reorganization. 2004-10-04T14:15:29Z 2004-10-04T14:15:29Z 2002-12-01 AIM-2002-021 http://hdl.handle.net/1721.1/5933 en_US AIM-2002-021 27 p. 7370490 bytes 1660395 bytes application/postscript application/pdf application/postscript application/pdf |
| spellingShingle | AI amorphous computing hierarchy leaderless distributed Beal, Jacob Leaderless Distributed Hierarchy Formation |
| title | Leaderless Distributed Hierarchy Formation |
| title_full | Leaderless Distributed Hierarchy Formation |
| title_fullStr | Leaderless Distributed Hierarchy Formation |
| title_full_unstemmed | Leaderless Distributed Hierarchy Formation |
| title_short | Leaderless Distributed Hierarchy Formation |
| title_sort | leaderless distributed hierarchy formation |
| topic | AI amorphous computing hierarchy leaderless distributed |
| url | http://hdl.handle.net/1721.1/5933 |
| work_keys_str_mv | AT bealjacob leaderlessdistributedhierarchyformation |