Persistent Nodes for Reliable Memory in Geographically Local Networks
dc.date.accessioned | 2004-10-08T20:38:47Z | |
dc.date.accessioned | 2018-11-24T10:21:38Z | |
dc.date.available | 2004-10-08T20:38:47Z | |
dc.date.available | 2018-11-24T10:21:38Z | |
dc.date.issued | 2003-04-15 | en_US |
dc.identifier.uri | http://hdl.handle.net/1721.1/6712 | |
dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/6712 | |
dc.description.abstract | 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. | en_US |
dc.format.extent | 19 p. | en_US |
dc.format.extent | 5503051 bytes | |
dc.format.extent | 1849500 bytes | |
dc.language.iso | en_US | |
dc.subject | AI | en_US |
dc.subject | robust atomic distributed amorphous | en_US |
dc.title | Persistent Nodes for Reliable Memory in Geographically Local Networks | en_US |
Files in this item
Files | Size | Format | View |
---|---|---|---|
AIM-2003-011.pdf | 1.849Mb | application/pdf | View/ |
AIM-2003-011.ps | 5.503Mb | application/postscript | View/ |