For a very large network deployed in space with only nearby nodes able to talk to each other, we want to do tasks like robust routing and data storage. One way to organize the network is via a hierarchy, but hierarchies often have a few critical nodes whose death can disrupt organization over long distances. I address this with a system of distributed aggregates called Persistent Nodes, such that spatially local failures disrupt the hierarchy in an area proportional to the diameter of the failure. I describe and analyze this system, which has been implemented in simulation.
| Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/6717 |
| Date | 01 May 2003 |
| Creators | Beal, Jacob |
| Source Sets | M.I.T. Theses and Dissertation |
| Language | en_US |
| Detected Language | English |
| Format | 12 p., 3383342 bytes, 1922951 bytes, application/postscript, application/pdf |
| Relation | AIM-2003-012 |
Page generated in 0.0022 seconds