Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6734Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Beal, Jacob | - |
| dc.creator | Gilbert, Seth | - |
| dc.date | 2004-10-08T20:43:07Z | - |
| dc.date | 2004-10-08T20:43:07Z | - |
| dc.date | 2003-12-17 | - |
| dc.date.accessioned | 2013-10-09T02:46:42Z | - |
| dc.date.available | 2013-10-09T02:46:42Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | AIM-2003-027 | - |
| dc.identifier | http://hdl.handle.net/1721.1/6734 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | We 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. | - |
| dc.format | 22 p. | - |
| dc.format | 1312502 bytes | - |
| dc.format | 499111 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AIM-2003-027 | - |
| dc.subject | AI | - |
| dc.subject | ad-hoc networks distributed algorithms atomic distributed shared memory | - |
| dc.title | RamboNodes for the Metropolitan Ad Hoc Network | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.