Simulating wide-area replication

Sape J. Mullender; Martijn van der Valk

Simulating wide-area replication

Sape J. Mullender, Martijn van der Valk

Research output: Contribution to conference › Paper › Academic › peer-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 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	Ireland
City	Connemara
Period	9/09/96 → 11/09/96
Other	8-11 September 1996

Keywords

IR-56254
EWI-1133

Access to Document

Mullender96simulating
open

Cite this

@conference{51edddac44df4c3bb514f798c96314b0,

title = "Simulating wide-area replication",

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.",

keywords = "IR-56254, EWI-1133",

author = "Mullender, {Sape J.} and {van der Valk}, Martijn",

note = "Imported from DIES; null ; Conference date: 09-09-1996 Through 11-09-1996",

year = "1996",

language = "Undefined",

pages = "267--274",

}

TY - CONF

T1 - Simulating wide-area replication

AU - Mullender, Sape J.

AU - van der Valk, Martijn

N1 - Conference code: 7

PY - 1996

Y1 - 1996

N2 - 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.

AB - 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.

KW - IR-56254

KW - EWI-1133

M3 - Paper

SP - 267

EP - 274

Y2 - 9 September 1996 through 11 September 1996

ER -