@article{Eugster2003LightweightPB,
author={Patrick Th. Eugster and Rachid Guerraoui and Sidath B. Handurukande and Petr Kuznetsov and Anne-Marie Kermarrec},
journal={ACM Trans. Comput. Syst.},
year={2003},
volume={21},
pages={341-374}
}
• Published 1 November 2003
• Computer Science
• ACM Trans. Comput. Syst.
Gossip-based broadcast algorithms, a family of probabilistic broadcast algorithms, trade reliability guarantees against "scalability" properties. Scalability in this context has usually been expressed in terms of message throughput and delivery latency, but there has been little work on how to reduce the memory consumption for membership management and message buffering at large scale.This paper presents lightweight probabilistic broadcast (lpbcast), a novel gossip-based broadcast algorithm…
611 Citations

## Figures from this paper

Probabilistic multicast
• Computer Science
Proceedings International Conference on Dependable Systems and Networks
• 2002
A scalable gossip-based multicast algorithm is proposed which ensures, with a high probability, that a process interested in a multicast event delivers that event and a process not interested in that event does not receive it.
Novel Gossip-Based Multicast Protocol with No Global View Information
• Computer Science
2008 Second International Conference on Future Generation Communication and Networking
• 2008
An efficient gossip-based multicast protocol to guarantee causally-ordered delivery semantics based on the local view of every individual member consisting of a subset of members continuously changing, whose size never excesses a determined threshold, without virtual synchrony and K-committee.
BGP-Based Clustering for Scalable and Reliable Gossip Broadcast
• Computer Science
Global Computing
• 2004
This paper presents a locality-based dissemination graph algorithm for scalable reliable broadcast that scales in terms of both network and memory usage and conveys the feasibility of the algorithm using both simulation and experimental results.
Reducing noise in gossip-based reliable broadcast
• Computer Science
Proceedings 20th IEEE Symposium on Reliable Distributed Systems
• 2001
A general garbage collection scheme that reduces the "noise" in gossip-based broadcast algorithms by using a simple heuristic to trade "useless" messages with "useful" ones and provides higher overall reliability than more conventional schemes.
Hierarchical Probabilistic Multicast
• Computer Science
• 2001
Hierarchical Probabilistic Multicast (hpmcast) is presented, a novel gossip-based algorithm which deals with the more complex case of multicasting an event to a subset of the system only and which ensures reliable delivery of events despite network failures.
• Computer Science
• 2010
This chapter provides an introduction to gossip-based broadcast on large-scale unstructured peer-to-peer overlay networks: it surveys the main results in the field, discusses techniques to build and maintain the overlays that support efficient dissemination strategies, and provides an in-depth discussion and experimental evaluation of two concrete protocols.
Gossiping with Network Coding
• Computer Science
2011 IEEE 17th Pacific Rim International Symposium on Dependable Computing
• 2011
A new gossip algorithm is proposed which incorporates network coding techniques to mitigate the high load on the network, with random linear coding, each message propagated in the new algorithm is randomly generated from the broadcast message.
Simulations results show that, in comparison with other existing protocols, HyParView-based gossip protocols not only provide better reliability but also support higher percentages of node failures, and are able to recover faster from these failures.
Low latency probabilistic broadcast in wide area networks
• Computer Science
Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems, 2004.
• 2004
A novel probabilistic broadcast protocol that reduces the average end-to-end latency by dynamically adapting to network topology and traffic conditions by using an unique strategy that consists in adjusting the fanout and preferred targets for different gossip rounds as a function of the properties of each node.

## References

SHOWING 1-10 OF 94 REFERENCES
• Computer Science
2001 International Conference on Dependable Systems and Networks
• 2001
Lightweight Probabilistic Broadcast is presented, a novel gossip-based broadcast algorithm which preserves the inherent throughput scalability of traditional gossip- based algorithms and adds a notion of membership management scalability: every process only knows a random subset of fixed size of the processes in the system.
Reducing noise in gossip-based reliable broadcast
• Computer Science
Proceedings 20th IEEE Symposium on Reliable Distributed Systems
• 2001
A general garbage collection scheme that reduces the "noise" in gossip-based broadcast algorithms by using a simple heuristic to trade "useless" messages with "useful" ones and provides higher overall reliability than more conventional schemes.
• Computer Science
2003 International Conference on Dependable Systems and Networks, 2003. Proceedings.
• 2003
This paper presents a novel adaptation mechanism that allows every node of a gossip-based broadcast algorithm to adjust the rate of message emission 1) to the amount of resources available to the
Reliable probabilistic communication in large-scale information dissemination systems
• Computer Science
• 2000
The theoretical analysis and evaluation of a scalable reliable group communication protocol for wide-area dissemination systems is presented and simulation results show that the protocol exhibits very stable behavior in the presence of transient and/or permanent failures.
A gossip-based reliable multicast for large-scale high-throughput applications
• Computer Science
Proceeding International Conference on Dependable Systems and Networks. DSN 2000
• 2000
This paper presents a reliable probabilistic multicast, rpbcast, that is a hybrid of the centralized and gossip-based approaches and shows that negative gossip allows pull based recovery and converges faster than push based recovery.
Directional Gossip: Gossip in a Wide Area Network
• Computer Science
EDCC
• 1999
A new gossip protocol is presented, called {\em directional gossip}, that uses flooding when necessary to attain good reliability and that uses gossip when flooding (and hence its inherent high overhead) is not needed.
Gossip versus Deterministic Flooding: Low Message Overhead and High Reliability for Broadcasting on Small Networks
• Computer Science
• 1999
This paper presents a protocol that superficially resembles rumor mongering but is deterministic, and compares the two approaches both at an abstract level and in terms of how they perform in an Ethernet.
Log-based receiver-reliable multicast for distributed interactive simulation
• Computer Science
SIGCOMM '95
• 1995
The notion of Log-Based Receiver-reliable Multicast (LBRM) communication is introduced, and a collection of log-based receiver reliable multicast optimizations are described and evaluated that provide an efficient, scalable protocol for high-performance simulation applications.
Peer-to-Peer Membership Management for Gossip-Based Protocols
• Computer Science
IEEE Trans. Computers
• 2003
This paper presents SCAMP (Scalable Membership protocol), a novel peer-to-peer membership protocol which operates in a fully decentralized manner and provides each member with a partial view of the group membership and proposes additional mechanisms to achieve balanced view sizes even with highly unbalanced subscription patterns.
Probabilistic Reliable Dissemination in Large-Scale Systems
• Computer Science
IEEE Trans. Parallel Distributed Syst.
• 2003
This paper provides a theoretical analysis of gossip-based protocols which relates their reliability to key system parameters (the system size, failure rates, and number of gossip targets) and shows how reliability can be maintained while alleviating drawback.