A Persistent Node is a redundant distributed mechanism for storing a key/value pair reliably in a geographically local network. In this paper, I develop a method of establishing Persistent Nodes in an amorphous matrix. I address issues of construction, usage, atomicity guarantees and reliability in the face of stopping failures. Applications include routing, congestion control, and data storage in gigascale networks.
| Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/6712 |
| Date | 15 April 2003 |
| Creators | Beal, Jacob |
| Source Sets | M.I.T. Theses and Dissertation |
| Language | en_US |
| Detected Language | English |
| Format | 19 p., 5503051 bytes, 1849500 bytes, application/postscript, application/pdf |
| Relation | AIM-2003-011 |
Page generated in 0.0018 seconds