Simulating wide-area replication

Sape J. Mullender, Martijn van der Valk

    Research output: Contribution to conferencePaperAcademicpeer-review

    46 Downloads (Pure)

    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 languageUndefined
    Pages267-274
    Number of pages8
    Publication statusPublished - 1996
    Event7th Workshop on ACM SIGOPS European Workshop: Systems Support for Worldwide Applications, EW 1996 - Connemara, Ireland, Connemara, Ireland
    Duration: 9 Sep 199611 Sep 1996
    Conference number: 7

    Conference

    Conference7th Workshop on ACM SIGOPS European Workshop: Systems Support for Worldwide Applications, EW 1996
    Abbreviated titleEW 1996
    CountryIreland
    CityConnemara
    Period9/09/9611/09/96
    Other8-11 September 1996

    Keywords

    • IR-56254
    • EWI-1133

    Cite this