Show simple item record

dc.contributor.authorBeal, Jacoben_US
dc.contributor.authorGilbert, Sethen_US
dc.date.accessioned2004-10-08T20:43:07Z
dc.date.available2004-10-08T20:43:07Z
dc.date.issued2003-12-17en_US
dc.identifier.otherAIM-2003-027en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/6734
dc.description.abstractWe present an algorithm to store data robustly in a large, geographically distributed network by means of localized regions of data storage that move in response to changing conditions. For example, data might migrate away from failures or toward regions of high demand. The PersistentNode algorithm provides this service robustly, but with limited safety guarantees. We use the RAMBO framework to transform PersistentNode into RamboNode, an algorithm that guarantees atomic consistency in exchange for increased cost and decreased liveness. In addition, a half-life analysis of RamboNode shows that it is robust against continuous low-rate failures. Finally, we provide experimental simulations for the algorithm on 2000 nodes, demonstrating how it services requests and examining how it responds to failures.en_US
dc.format.extent22 p.en_US
dc.format.extent1312502 bytes
dc.format.extent499111 bytes
dc.format.mimetypeapplication/postscript
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.relation.ispartofseriesAIM-2003-027en_US
dc.subjectAIen_US
dc.subjectad-hoc networks distributed algorithms atomic distributed shared memoryen_US
dc.titleRamboNodes for the Metropolitan Ad Hoc Networken_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record