Issue No. 02 - February (2003 vol. 52)
<p><b>Abstract</b>—Gossip-based protocols for group communication have attractive scalability and reliability properties. The probabilistic gossip schemes studied so far typically assume that each group member has full knowledge of the global membership and chooses gossip targets uniformly at random. The requirement of global knowledge impairs their applicability to very large-scale groups. In this paper, we present SCAMP (Scalable Membership protocol), a novel peer-to-peer membership protocol which operates in a fully decentralized manner and provides each member with a partial view of the group membership. Our protocol is self-organizing in the sense that the size of partial views naturally converges to the value required to support a gossip algorithm reliably. This value is a function of the group size, but is achieved without any node knowing the group size. We propose additional mechanisms to achieve balanced view sizes even with highly unbalanced subscription patterns. We present the design, theoretical analysis, and a detailed evaluation of the basic protocol and its refinements. Simulation results show that the reliability guarantees provided by SCAMP are comparable to previous schemes based on global knowledge. The scale of the experiments attests to the scalability of the protocol.</p>
Scalability, reliability, peer-to-peer, gossip-based probabilistic multicast, membership, group communication, random graphs.
L. Massoulié, A. J. Ganesh and A. Kermarrec, "Peer-to-Peer Membership Management for Gossip-Based Protocols," in IEEE Transactions on Computers, vol. 52, no. , pp. 139-149, 2003.