Efficient and adaptive epidemic-style protocols for reliable and scalable multicast

@article{Gupta2006EfficientAA,
  title={Efficient and adaptive epidemic-style protocols for reliable and scalable multicast},
  author={Indranil Gupta and Anne-Marie Kermarrec and Ayalvadi J. Ganesh},
  journal={IEEE Transactions on Parallel and Distributed Systems},
  year={2006},
  volume={17},
  pages={593-605}
}
Epidemic-style (gossip-based) techniques have recently emerged as a class of scalable and reliable protocols for peer-to-peer multicast dissemination in large process groups. However, popular implementations of epidemic-style dissemination suffer from two major drawbacks: 1) Network overhead: when deployed on a WAN-wide or VPN-wide scale, they generate a large number of packets that transit across the boundaries of multiple network domains (e.g., LANs, subnets, ASs), causing an overload on core… 
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.
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).
Hybrid Dissemination: Adding Determinism to Probabilistic Multicasting in Large-Scale P2P Systems
TLDR
This paper devise a hybrid push-based dissemination algorithm, combining probabilistic with deterministic properties, which limits message overhead to an order of magnitude lower than that of the purely Probabilistic dissemination model, while retaining strong probabilism guarantees for complete dissemination of messages.
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.
RRG: redundancy reduced gossip protocol for real-time N-to-N dynamic group communication
TLDR
This paper proposes a novel protocol called Redundancy Reduced Gossip for real-time N-to-N group communication, and shows that this protocol can achieve a considerably lower traffic load than conventional Push-based gossip protocols and conventional push-pull gossip protocols for the same probability of successful delivery.
Efficient Epidemic Multicast in Heterogeneous Networks
TLDR
This paper points out how to break out of the dilemma of the scalability and resilience of epidemic multicast by lazily deferring message transmission according to a configurable policy.
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.
A Survey of Scalability Approaches for Reliable Causal Broadcasts
TLDR
This paper provides a historical survey of different approaches used in reliable causal broadcast protocols and focuses on protocol mechanisms for enhancing both scalability and adaptability.
Bounded gossip: a gossip protocol for large-scale datacenters
TLDR
This paper presents and evaluates 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.
Topology Dissemination for Reliable One-Hop Distributed Hash Tables
TLDR
This work contributes aecast, a new topology dissemination algorithm for one-hop DHTs, which gives at least fivefold fewer out-of-date nodes on average within one round of a topology update.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 39 REFERENCES
Efficient epidemic-style protocols for reliable and scalable multicast
TLDR
This paper focuses on a detailed discussion and evaluation of only the hierarchical gossiping protocol, an adaptive multicast dissemination framework that allows use of any gossiping primitive within it, and an overview of the adaptive dissemination protocol.
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.
Directional Gossip: Gossip in a Wide Area Network
TLDR
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.
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.
Efficient data distribution in large-scale multicast networks
TLDR
This dissertation presents MESH: a novel, distributed transport protocol designed for large-scale multicast, and designs and implements a reliable protocol and a deadline-driven reliable protocol in a high-fidelity simulation of SURAnet and vBNSnet.
Scalable application layer multicast
TLDR
A new scalable application-layer multicast protocol, specifically designed for low-bandwidth, data streaming applications with large receiver sets, which has lower link stress, improved or similar end-to-end latencies and similar failure recovery properties.
Lightweight probabilistic broadcast
TLDR
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.
SWIM: scalable weakly-consistent infection-style process group membership protocol
TLDR
This paper reports on the design, implementation and performance of the SWIM sub-system on a large cluster of commodity PCs, and discusses the extensibility of the design to a WAN-wide scale.
Bimodal multicast
TLDR
This article introduces the protocol, provides a theoretical analysis of its behavior, review experimental results, and discusses some candidate applications, confirming that bimodal multicast is reliable, scalable, and that the protocol provides remarkably stable delivery throughput.
Scalable fault-tolerant aggregation in large process groups
TLDR
A technique to impose an abstract hierarchy on such large groups, describing how this hierarchy can be made to mirror the network topology is proposed and presented, and a protocol based on gossiping is presented that uses this hierarchical technique.
...
1
2
3
4
...