Simulating wide-area replication

  • Authors:
  • Sape J. Mullender;Martijn van der Valk

  • Affiliations:
  • University of Twente, 7500 AE Enschede, Netherlands;University of Twente, 7500 AE Enschede, Netherlands

  • Venue:
  • EW 7 Proceedings of the 7th workshop on ACM SIGOPS European workshop: Systems support for worldwide applications
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

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.