SCAMP: Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication
Lists
Only you see this
Abstract
Gossip-based protocols have received considerable attention for broadcast applications due to their attractive scalability and reliability properties. The reliability of probabilistic gossip schemes studied so far depends on each user having knowledge of the global membership and choosing gossip targets uniformly at random. The requirement of global knowledge is undesirable in large-scale distributed systems. In this paper, we present a novel peer-to-peer membership service which operates in a completely decentralized manner in that nobody has global knowledge of membership. However, membership information is replicated robustly enough to support gossip with high reliability. Our scheme is completely self-organizing in the sense that the size of local views naturally converges to the ‘right’ value for gossip to succeed. This ‘right’ value is a function of system size, but is achieved without any node having to know the system size. We present the design, theoretical analysis and preliminary evaluation of Scamp. Simulations show that its performance is comparable to that of previous schemes which use global knowledge of membership at each node.
BibTeX
@inproceedings{ganesh2001scamp,
author = {Ayalvadi J. Ganesh and Anne-Marie Kermarrec and Laurent Massoulié},
title = {{SCAMP: Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication}},
booktitle = {Networked Group Communication},
year = {2001},
doi = {10.1007/3-540-45546-9\_4},
}Loading related content...