The peer sampling service: Experimental evaluation of unstructured gossip-based implementations

Márk Jelasity*, Rachid Guerraoui, Anne-Marie Kermarrec, Maarten van Steen

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

161 Citations (Scopus)


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 abstraction. 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.

Original languageEnglish
Title of host publicationMiddleware 2004
Subtitle of host publicationACM/IFIP/USENIX International Middleware Conference, Toronto, Canada, October 18-22, 2004. Proceedings
Place of PublicationBerlin, Heidelberg
Number of pages20
ISBN (Electronic)978-3-540-30229-2
ISBN (Print)978-3-540-23428-9
Publication statusPublished - 1 Dec 2004
Externally publishedYes
EventACM/IFIP/USENIX International Conference on Distributed Systems Platforms and Open Distributed Processing, Middleware 2004 - Toronto, Canada
Duration: 18 Oct 200422 Oct 2004

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


ConferenceACM/IFIP/USENIX International Conference on Distributed Systems Platforms and Open Distributed Processing, Middleware 2004
Abbreviated titleMiddleware 2004


  • Random graphs
  • Degree distribution
  • Overlay networks
  • Average path length
  • Dynamic complex network


Dive into the research topics of 'The peer sampling service: Experimental evaluation of unstructured gossip-based implementations'. Together they form a unique fingerprint.

Cite this