Group membership: a novel approach and the first single-round algorithm

We establish a new worst-case upper bound on the Membership problem: We present a simple algorithm that is able to always achieve Agreement on Views within a single message latency after the final network events leading to stability of the group become known to the membership servers. In contrast, all of the existing membership algorithms may require two or more rounds of message exchanges. Our algorithm demonstrates that the Membership problem can be solved simpler and more efficiently than previously believed. By itself, the algorithm may produce disagreement (that is, inconsistent, transient views) prior to the “final” view. Even though this is allowed by the problem specification, such views may create overhead at the application level, and are therefore undesirable. We propose a new approach for designing group membership services in which our algorithm for reaching Agreement on Views is combined with a filter-like mechanism for reducing disagreements. This approach can u...

• Type: Conference
• Year: 2004
• Where: PODC
• Authors: Roger I. Khazan
• Keywords: Algorithm, Distributed And Parallel Computing, Membership Problem, PODC 2004, Worst-case Upper Bound