RamboNodes for the Metropolitan Ad Hoc Network
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...
| Main Authors: | , |
|---|---|
| Language: | en_US |
| Published: |
2005
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/30439 |
| _version_ | 1811075055859269632 |
|---|---|
| author | Beal, Jacob Gilbert, Seth |
| author_facet | Beal, Jacob Gilbert, Seth |
| author_sort | Beal, Jacob |
| collection | MIT |
| 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. |
| first_indexed | 2024-09-23T09:59:56Z |
| id | mit-1721.1/30439 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T09:59:56Z |
| publishDate | 2005 |
| record_format | dspace |
| spelling | mit-1721.1/304392019-04-11T04:57:53Z RamboNodes for the Metropolitan Ad Hoc Network Beal, Jacob Gilbert, Seth AI ad-hoc networks distributed algorithms atomic distributed shared memory 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. 2005-12-22T01:15:30Z 2005-12-22T01:15:30Z 2003-12-17 MIT-CSAIL-TR-2003-034 AIM-2003-027 http://hdl.handle.net/1721.1/30439 en_US Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory 22 p. 23886105 bytes 803571 bytes application/postscript application/pdf application/postscript application/pdf |
| spellingShingle | AI ad-hoc networks distributed algorithms atomic distributed shared memory Beal, Jacob Gilbert, Seth RamboNodes for the Metropolitan Ad Hoc Network |
| title | RamboNodes for the Metropolitan Ad Hoc Network |
| title_full | RamboNodes for the Metropolitan Ad Hoc Network |
| title_fullStr | RamboNodes for the Metropolitan Ad Hoc Network |
| title_full_unstemmed | RamboNodes for the Metropolitan Ad Hoc Network |
| title_short | RamboNodes for the Metropolitan Ad Hoc Network |
| title_sort | rambonodes for the metropolitan ad hoc network |
| topic | AI ad-hoc networks distributed algorithms atomic distributed shared memory |
| url | http://hdl.handle.net/1721.1/30439 |
| work_keys_str_mv | AT bealjacob rambonodesforthemetropolitanadhocnetwork AT gilbertseth rambonodesforthemetropolitanadhocnetwork |