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

Márk Jelasity, Rachid Guerraoui, Anne Marie Kermarrec, Maarten Van Steen

Research output: Chapter

139 Citations (Scopus)

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 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 publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsHans-Arno Jacobsen
PublisherSpringer Verlag
Pages79-98
Number of pages20
ISBN (Electronic)3540234284, 9783540234289
DOIs
Publication statusPublished - 2004

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3231
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint 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

    Jelasity, M., Guerraoui, R., Kermarrec, A. M., & Van Steen, M. (2004). The peer sampling service: Experimental evaluation of unstructured gossip-based implementations. In H-A. Jacobsen (Ed.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 79-98). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3231). Springer Verlag. https://doi.org/10.1007/978-3-540-30229-2_5