The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations

In recent years, the gossip-based communication model in large-scale distributed systems has become a general paradigm with important applications which include information dissemination, aggregation, overlay topology management and synchronization. At the heart of all of these protocols lies a fundamenributed abstraction: the peer sampling service. In short, the aim of this service is to provide every node with peers to exchange information with. Analytical studies reveal a high reliability and efficiency of gossip-based protocols, under the (often implicit) assumption that the peers to send gossip messages to are selected uniformly at random from the set of all nodes. In practice—instead of requiring all nodes to know all the peer nodes so that a random sample could be drawn—a scalable and efficient way to implement the peer sampling service is by constructing and maintaining dynamic unstructured overlays through gossiping membership information itself. This paper presents a ge...

• Type: Conference
• Year: 2004
• Where: MIDDLEWARE
• Authors: Márk Jelasity, Rachid Guerraoui, Anne-Marie Kermarrec, Maarten van Steen
• Keywords: Efficient Peer, MIDDLEWARE 2004, Peer Sampling Algorithms, Peer Sampling Service