Correctness of gossip-based membership under message loss

Due to their simplicity and effectiveness, gossip-based membership protocols have become the method of choice for maintaining partial membership in large P2P systems. A variety of gossip-based membership protocols were proposed. Some were shown to be effective empirically, lacking analytic understanding of their properties. Others were analyzed under simplifying assumptions, such as lossless and delay-less network. It is not clear whether the analysis results hold in dynamic networks where both nodes and network links can fail. In this paper we try to bridge this gap. We first enumerate the desirable properties of a gossip-based membership protocol, such as view uniformity, independence, and load balance. We then propose a simple Send & Forget protocol, and show that even in the presence of message loss, it achieves the desirable properties. Categories and Subject Descriptors: H.3.4: Distributed systems. General Terms: Algorithms, Reliability, Theory.

• Type: Conference
• Year: 2009
• Where: PODC
• Authors: Maxim Gurevich, Idit Keidar
• Keywords: Desirable Properties, Gossip-based Membership Protocols, Large P2p Systems, Parallel Computing, PODC 2009