Gossip-based peer sampling

Jelasity, Márk; Voulgaris, Spyros; Guerraoui, Rachid; Kermarrec, Anne-Marie; Steen, Maarten van

doi:10.1145/1275517.1275520

Cited by 396 publications

(514 citation statements)

References 44 publications

Supporting

Mentioning

505

Contrasting

Unclassified

Order By: Relevance

“…To that end, we rely on the family of Peer Sampling Service protocols [11], and specifically Cyclon [33], which provides each node with a regularly refreshed list of links to random other peers, in a fully decentralized manner and at negligible bandwidth cost.…”

Section: Supporting Mechanismsmentioning

confidence: 99%

“…As a result, views are periodically refreshed with new links to random other peers of the overlay. When the right policies are followed (see [11] and [33] for details), this method has shown to produce overlays that strongly resemble random graphs, that is, at any given moment each node's view contains links to nodes selected uniformly at random from the whole network. Moreover, this process has shown to converge in a few dozen cycles irrespectively of the initial topology, and due to the selfhealing nature of Cyclon the respective properties are retained even in the face of node churn.…”

Section: Supporting Mechanismsmentioning

confidence: 99%

“…They rely on a periodic pairwise exchange of information between peers, and are particularly suited to implement a global emergent behavior as a result of local interactions based on limited knowledge. They have been applied to a wide variety of applications [7,11,13,16,32]. Yet, the most classical use of gossip protocols is to reliably disseminate data in large networks in a collaborative manner [2,8,14].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Pulp: An adaptive gossip-based dissemination protocol for multi-source message streams

Felber

Kermarrec

Leonini

et al. 2012

Peer-to-Peer Netw. Appl.

Self Cite

View full text Add to dashboard Cite

Gossip-based protocols provide a simple, scalable, and robust way to disseminate messages in large-scale systems. In such protocols, messages are spread in an epidemic manner. Gossiping may take place between nodes using push, pull, or a combination. Push-based systems achieve reasonable latency and high resilience to failures but may impose an unnecessarily large redundancy and overhead on the system. At the other extreme, pull-based protocols impose a lower overhead on the network at the price of increased latencies. A few hybrid approaches have been proposedtypically pushing control messages and pulling datato avoid the redundancy of high-volume content and single-source streams. Yet, to the best of our knowledge, no other system intermingles push and pull in a multiple-senders scenario, in such a way that data messages of one help in carrying control messages of the other and in adaptively adjusting its rate of operation, further reducing overall cost and improving both on delays and robustness. In this paper, we propose an efficient generic push-pull dissemination protocol, Pulp, which combines the best of both worlds. Pulp exploits the efficiency of push approaches, while limiting redundant messages and therefore imposing a low overhead, as pull protocols do. Pulp leverages the dissemination of multiple messages from diverse sources: by exploiting the push phase of messages to transmit information about other disseminations, Pulp enables an efficient pulling of other messages, which themselves help in turn with the dissemination of pending messages. We deployed Pulp on a cluster and on PlanetLab. Our results demonstrate that Pulp achieves an appealing trade-off between coverage, message redundancy, and propagation delay.

show abstract

Section: Supporting Mechanismsmentioning

confidence: 99%

Section: Supporting Mechanismsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Pulp: An adaptive gossip-based dissemination protocol for multi-source message streams

Felber

Kermarrec

Leonini

et al. 2012

Peer-to-Peer Netw. Appl.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Gossip-based PSS' can ensure that node descriptors are distributed uniformly at random over all partial views [18]. However, in the Internet, where a high percentage of nodes are behind NATs, these traditional gossip-based PSS' become biased.…”

Section: Introductionmentioning

confidence: 99%

“…In gossip-based PSS', protocol execution at each node is divided into periodic cycles [18]. In each cycle, every node selects a node from its partial view to exchange a subset of its partial view with the selected node.…”

Section: Introductionmentioning

confidence: 99%

Gozar: NAT-Friendly Peer Sampling with One-Hop Distributed NAT Traversal

Payberah

Dowling

Haridi

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Gossip-based peer sampling protocols have been widely used as a building block for many large-scale distributed applications. However, Network Address Translation gateways (NATs) cause most existing gossiping protocols to break down, as nodes cannot establish direct connections to nodes behind NATs (private nodes). In addition, most of the existing NAT traversal algorithms for establishing connectivity to private nodes rely on third party servers running at a well-known, public IP addresses. In this paper, we present Gozar, a gossip-based peer sampling service that: (i) provides uniform random samples in the presence of NATs, and (ii) enables direct connectivity to sampled nodes using a fully distributed NAT traversal service, where connection messages require only a single hop to connect to private nodes. We show in simulation that Gozar preserves the randomness properties of a gossip-based peer sampling service. We show the robustness of Gozar when a large fraction of nodes reside behind NATs and also in catastrophic failure scenarios. For example, if 80% of nodes are behind NATs, and 80% of the nodes fail, more than 92% of the remaining nodes stay connected. In addition, we compare Gozar with existing NAT-friendly gossip-based peer sampling services, Nylon and ARRG. We show that Gozar is the only system that supports one-hop NAT traversal, and its overhead is roughly half of Nylon's.

show abstract

Randomized gossip algorithms for maintaining a distributed bulletin board with guaranteed age properties

Amar

Barak

Drezner

et al. 2009

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYScalable computer systems, including clusters and multi-cluster grids, require routine exchange of information about the state of system-wide resources among their nodes. Gossip-based algorithms are popular for providing such information services due to their simplicity, fault tolerance and low communication overhead. This paper presents a randomized gossip algorithm for maintaining a distributed bulletin board among the nodes of a scalable computer system. In this algorithm each node routinely disseminates its most recently acquired information while maintaining a snapshot of the other nodes' states. The paper provides analytical approximations for the expected average age, the age distribution and the expected maximal age for the acquired information at each node. We confirm our results by measurements of the performance of the algorithm on a multi-cluster campus grid with 256 nodes and by simulations of configurations with up to 2048 nodes. The paper then presents practical enhancements of the algorithm, which makes it more suitable for a real system. Such enhancements include using fixed-size messages, reducing the number of messages sent to inactive nodes and supporting urgent information. The enhanced algorithm guarantees the age properties of the information at each node in the configurations with an arbitrary number of inactive nodes. It is being used in our campus grid for resource discovery, for dynamic assignment of processes to the best available nodes, for load-balancing and for on-line monitoring.

show abstract

Gossip-based peer sampling

Cited by 396 publications

References 44 publications

Pulp: An adaptive gossip-based dissemination protocol for multi-source message streams

Pulp: An adaptive gossip-based dissemination protocol for multi-source message streams

Gozar: NAT-Friendly Peer Sampling with One-Hop Distributed NAT Traversal

Randomized gossip algorithms for maintaining a distributed bulletin board with guaranteed age properties

Contact Info

Product

Resources

About