Client-server oriented algorithm for virtually synchronous group membership in WANs

Idit Keidar*, Jeremy Sussman, Keith Marzullo, Danny Dolev

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

35 Scopus citations

Abstract

We describe a novel scalable group membership service designed explicitly for wide area networks. Our membership service is scalable in the number of groups supported, in the number of members in each group, and in the topology each group spans. Our service also supplies the hooks needed to provide clients with full virtual synchrony semantics. Our service attains, on average, a low message overhead by agreeing on membership within a single message round. Furthermore, our service avoids notifying the application of obsolete membership views when the network is unstable, yet it converges when the network has stabilized.

Original languageEnglish
Pages356-365
Number of pages10
StatePublished - 2000
Externally publishedYes
Event20th International Conference on Distributed Computing Systems (ICDCS 2000) - Taipei, Taiwan
Duration: 10 Apr 200013 Apr 2000

Conference

Conference20th International Conference on Distributed Computing Systems (ICDCS 2000)
CityTaipei, Taiwan
Period10/04/0013/04/00

Fingerprint

Dive into the research topics of 'Client-server oriented algorithm for virtually synchronous group membership in WANs'. Together they form a unique fingerprint.

Cite this