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

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

Cached

Download Links

by Márk Jelasity , Rachid Guerraoui , Anne-marie Kermarrec , Maarten Van Steen

Venue:	In Middleware ’04: Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Citations:	124 - 28 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations	INFERENCE
AUTHOR NAME	Márk Jelasity	SVM HeaderParse 0.2
AUTHOR AFFIL	1 University of Bologna,	SVM HeaderParse 0.2
AUTHOR NAME	Rachid Guerraoui	SVM HeaderParse 0.2
AUTHOR AFFIL	1 University of Bologna,	SVM HeaderParse 0.2
AUTHOR NAME	Anne-marie Kermarrec	SVM HeaderParse 0.2
AUTHOR AFFIL	1 University of Bologna,	SVM HeaderParse 0.2
AUTHOR NAME	Maarten Van Steen	SVM HeaderParse 0.2
AUTHOR AFFIL	1 University of Bologna,	SVM HeaderParse 0.2
ABSTRACT	Abstract. 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 fundamental distributed 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 generic framework to implement reliable and efficient peer sampling services. The framework generalizes existing approaches and makes it easy to introduce new ones. We use this framework to explore and compare several implementations of our abstract scheme. Through extensive experimental analysis, we show that all of them lead to different peer sampling services none of which is uniformly random. This clearly renders traditional theoretical approaches invalid, when the underlying peer sampling service is based on a gossip-based scheme. Our observations also help explain important differences between design choices of peer sampling algorithms, and how these impact the reliability of the corresponding service. 1	SVM HeaderParse 0.2
YEAR	2004	INFERENCE
VENUE	In Middleware ’04: Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	79--98	INFERENCE
VOLUME	3231	INFERENCE
CITATIONS	30 found	ParsCit 1.0