Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Computer Science and Artificial Intelligence Lab (CSAIL)
  3. Artificial Intelligence Lab Publications
  4. AI Memos (1959 - 2004)
  5. A Robust Amorphous Hierarchy from Persistent Nodes

A Robust Amorphous Hierarchy from Persistent Nodes

Thumbnail Image
Download
Name

AIM-2003-012.pdf

Size

1.83 MB

Format

Adobe PDF

Checksum (MD5)

1323364cd06125cc07df7814c7bf2288

Thumbnail Image
Download
Name

AIM-2003-012.ps

Size

3.23 MB

Format

PostScript

Checksum (MD5)

992e12a401e27eb973e58c9bccbf6ff3

Author(s)
Beal, Jacob
Date Issued
May 1, 2003
Series/Report no.
AIM-2003-012
Abstract
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.
Subjects
AI
amorphous distributed fault tolerant gigascale
Persistent DSpace Link
http://hdl.handle.net/1721.1/6717
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.