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.
| Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/5933 |
| Date | 01 December 2002 |
| Creators | Beal, Jacob |
| Source Sets | M.I.T. Theses and Dissertation |
| Language | en_US |
| Detected Language | English |
| Format | 27 p., 7370490 bytes, 1660395 bytes, application/postscript, application/pdf |
| Relation | AIM-2002-021 |
Page generated in 0.0017 seconds