Persistent Nodes for Reliable Memory in Geographically Local Networks

dc.creator	Beal, Jacob
dc.date	2004-10-08T20:38:47Z
dc.date	2004-10-08T20:38:47Z
dc.date	2003-04-15
dc.date.accessioned	2013-10-09T02:46:32Z
dc.date.available	2013-10-09T02:46:32Z
dc.date.issued	2013-10-09
dc.identifier	AIM-2003-011
dc.identifier	http://hdl.handle.net/1721.1/6712
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721
dc.description	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.
dc.format	19 p.
dc.format	5503051 bytes
dc.format	1849500 bytes
dc.format	application/postscript
dc.format	application/pdf
dc.language	en_US
dc.relation	AIM-2003-011
dc.subject	AI
dc.subject	robust atomic distributed amorphous
dc.title	Persistent Nodes for Reliable Memory in Geographically Local Networks

Files in this item

Files	Size	Format	View
There are no files associated with this item.