DMCA
Peer-to-peer membership management for gossip-based protocols (2003)
Cached
Download Links
| Venue: | IEEE TRANSACTIONS ON COMPUTERS |
| Citations: | 221 - 23 self |
BibTeX
@ARTICLE{Ganesh03peer-to-peermembership,
author = {Ayalvadi J. Ganesh and Anne-Marie Kermarrec and Laurent Massoulié},
title = {Peer-to-peer membership management for gossip-based protocols},
journal = {IEEE TRANSACTIONS ON COMPUTERS},
year = {2003},
volume = {52},
number = {2},
pages = {139--149}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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.
Keyphrases
gossip-based protocol peer-to-peer membership management partial view global knowledge group size novel peer-to-peer membership protocol group membership scalable membership protocol gossip target additional mechanism theoretical analysis reliability property full knowledge global membership previous scheme view size detailed evaluation basic protocol probabilistic gossip scheme attractive scalability group member large-scale group simulation result group communication reliability guarantee gossip algorithm unbalanced subscription pattern
