Abstract
We describe our experiences with simulating replication algorithms for use in far flung distributed systems. The algorithms under scrutiny mimic epidemics. Epidemic algorithms seem to scale and adapt to change (such as varying replica sets) well. The loose consistency guarantees they make seem more useful in applications where availability strongly outweighs correctness; e.g., distributed name service.
Original language | Undefined |
---|---|
Pages | 267-274 |
Number of pages | 8 |
Publication status | Published - 1996 |
Event | 7th Workshop on ACM SIGOPS European Workshop: Systems Support for Worldwide Applications, EW 1996 - Connemara, Ireland, Connemara, Ireland Duration: 9 Sep 1996 → 11 Sep 1996 Conference number: 7 |
Conference
Conference | 7th Workshop on ACM SIGOPS European Workshop: Systems Support for Worldwide Applications, EW 1996 |
---|---|
Abbreviated title | EW 1996 |
Country/Territory | Ireland |
City | Connemara |
Period | 9/09/96 → 11/09/96 |
Other | 8-11 September 1996 |
Keywords
- IR-56254
- EWI-1133