A Robust Amorphous Hierarchy from Persistent Nodes

J. Beal (USA)


Amorphous Computing, Distributed Hierarchy


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 dis tributed aggregates called Persistent Nodes, such that spa tially local failures disrupt the hierarchy in an area propor tional to the diameter of the failure. I describe and analyze this system, which has been successfully demonstrated in simulation on 2000 processors.

Important Links:

Go Back