HyParView: A Membership Protocol for Reliable Gossip-Based Broadcast

@article{Leitao2007HyParViewAM,
  title={HyParView: A Membership Protocol for Reliable Gossip-Based Broadcast},
  author={Joao Carlos Antunes Leitao and J. Pereira and Lu{\'i}s E. T. Rodrigues},
  journal={37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07)},
  year={2007},
  pages={419-429}
}
  • J. Leitao, J. Pereira, L. Rodrigues
  • Published 25 June 2007
  • Computer Science
  • 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07)
Gossip, or epidemic, protocols have emerged as a powerful strategy to implement highly scalable and resilient reliable broadcast primitives. Due to scalability reasons, each participant in a gossip protocol maintains a partial view of the system. The reliability of the gossip protocol depends upon some critical properties of these views, such as degree distribution and clustering coefficient. Several algorithms have been proposed to maintain partial views for gossip protocols. In this paper, we… 

Figures from this paper

Gossip-Based Broadcast
TLDR
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.
RASM: A Reliable Algorithm for Scalable Multicast
TLDR
RASM is proposed, a scalable distributed protocol for application-level multicast that takes into consideration the reliability of components: nodes and communication links can fail, unexpectedly, ceasing their operation and dropping messages, respectively.
CLON: Overlay Networks and Gossip Protocols for Cloud Environments
TLDR
The proposed clon protocol combines an overlay that gives preference to local links and a dissemination strategy that takes into account locality, which results in a reduction of traffic in constrained links by an order of magnitude, while at the same time preserving the resilience properties that make gossip-based protocols so attractive.
Topology-aware Gossip Dissemination for Large-scale Datacenters
TLDR
This thesis presents a novel gossip protocol for datacenters, named Bounded Gossip, that provides an adequate load distribution among the different layers of the switching fabric of the datacenter, avoiding being a source of network bottlenecks.
RT / 52 / 2009 RASM : A Reliable Algorithm for Scalable Multicast
TLDR
RASM is proposed, a scalable distributed protocol for application-level multicast that takes into consideration the reliability of components: nodes and communication links can fail, unexpectedly, ceasing their operation and dropping messages, respectively.
X-BOT: A Protocol for Resilient Optimization of Unstructured Overlays
TLDR
X-BOT is a new protocol that allows to bias the topology of an unstructured gossip overlay network and preserves several key properties of the original (non-biased) overlay (most notably, the node degree and consequently, the overlay connectivity).
A Gossiping Framework for Scalaris
TLDR
The aim of this work is to conceptualise and implement a gossiping framework for Scalaris, a distributed key-value store with guarantees of atomicity, concurrency, isolation and durability on transactions (ACID properties), and to improve the gossip based aggregation of load information in Scalaris.
X-BOT: A Protocol for Resilient Optimization of Unstructured Overlay Networks
TLDR
X-BOT is a new protocol that allows to bias the topology of an unstructured gossip overlay network and preserves several key properties of the original (nonbiased) overlay.
Topology Aware Gossip Overlays
TLDR
This paper proposes a new scheme that allows an unstructured gossip overlay network to bias its topology accordingly to some efficiency metric, for instance to better match the topology of the underlying network.
An Autonomic Implementation of Reliable Broadcast Based on Dynamic Spanning Trees
TLDR
This work introduces an autonomic strategy to implement reliable broadcast that employs spanning trees that are dynamically built embedded in the overlay of processes self-organize themselves on an overlay based on a hypercube-like topology.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 25 REFERENCES
Gossip-based broadcast protocols
TLDR
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.
Peer-to-Peer Membership Management for Gossip-Based Protocols
TLDR
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
TLDR
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.
SCAMP: Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication
TLDR
This paper presents a novel peer-to-peer membership service which operates in a completely decentralized manner in that nobody has global knowledge of membership, and demonstrates that membership information is replicated robustly enough to support gossip with high reliability.
CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays
TLDR
The protocol is shown to construct graphs that have low diameter, low clustering, highly symmetric node degrees, and that are highly resilient to massive node failures, and it is shown that the protocol is highly reactive to restoring randomness when a large number of nodes fail.
The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations
TLDR
This paper presents a generic framework to implement reliable and efficient peer sampling services, which generalizes existing approaches and makes it easy to introduce new ones, and shows that all of them lead to differentpeer sampling services none of which is uniformly random.
Inexpensive Membership Management for Unstructured P 2 P Overlays
TLDR
The protocol is shown to construct graphs that have low diameter, low clustering, highly symmetric node degrees, and that are highly resilient to massive node failures, and it is shown that the protocol is highly reactive to restoring randomness when large numbers of nodes fail.
CREW: A Gossip-based Flash-Dissemination System
TLDR
CREW (Concurrent Random Expanding Walkers), a scalable, lightweight, and autonomic gossip-based protocol, is proposed that outperforms both traditional gossip and current large content dissemination systems, across a wide range of comparative metrics.
Probabilistic Broadcast
TLDR
A class of scalable and probabilisticly reliable communication protocols is presented which is strongly self-stabilizing in a sense similar, although not identical to, the notion of self stabilizing systems proposed by Dijkstra.
Lightweight probabilistic broadcast
TLDR
This paper presents lightweight probabilistic broadcast (lpbcast), a novel gossip-based broadcast algorithm, which complements the inherent throughput scalability of traditional probabilism broadcast algorithms with a scalable memory management technique.
...
1
2
3
...