Title:   Persistent Nodes for Reliable Memory in Geographically Local Networks

Speaker: Jake Beal

Place:   NE43-308
Time:    1-2:30pm
Date:    May 16, 2002

Abstract:

For a very large, mostly stationary, network deployed in space with
only nearby machines able to talk to each other, we want to perform
tasks like robust routing and data storage. I present a system of
localized distributed aggregates called Persistent Nodes, which
preserve data via mobility and redundancy, while guaranteeing
atomicity in the face of regional stopping failures. The Persistent
Node construct can be used as a foundation for solving larger problems
like routing, resource allocation, or data storage.