Show simple item record

Persistent Nodes for Reliable Memory in Geographically Local Networks

dc.date.accessioned2004-10-08T20:38:47Z
dc.date.accessioned2018-11-24T10:21:38Z
dc.date.available2004-10-08T20:38:47Z
dc.date.available2018-11-24T10:21:38Z
dc.date.issued2003-04-15en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/6712
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/6712
dc.description.abstractA 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.extent19 p.en_US
dc.format.extent5503051 bytes
dc.format.extent1849500 bytes
dc.language.isoen_US
dc.subjectAIen_US
dc.subjectrobust atomic distributed amorphousen_US
dc.titlePersistent Nodes for Reliable Memory in Geographically Local Networksen_US


Files in this item

FilesSizeFormatView
AIM-2003-011.pdf1.849Mbapplication/pdfView/Open
AIM-2003-011.ps5.503Mbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record