Epidemic Broadcast Trees

@article{Leitao2007EpidemicBT,
  title={Epidemic Broadcast Trees},
  author={Joao Carlos Antunes Leitao and J. Pereira and Lu{\'i}s E. T. Rodrigues},
  journal={2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007)},
  year={2007},
  pages={301-310}
}
  • J. Leitao, J. Pereira, L. Rodrigues
  • Published 10 October 2007
  • Computer Science
  • 2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007)
There is an inherent trade-off between epidemic and deterministic tree-based broadcast primitives. Tree-based approaches have a small message complexity in steady-state but are very fragile in the presence of faults. Gossip, or epidemic, protocols have a higher message complexity but also offer much higher resilience. This paper proposes an integrated broadcast scheme that combines both approaches. We use a low cost scheme to build and maintain broadcast trees embedded on a gossip-based overlay… 

Figures and Tables 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.
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.
Optimal Schedule on Message Broadcast Tree in Structured Peer-to-Peer Networks
TLDR
This paper presents an optimal algorithm and its two simplified variants to compute a minimum round schedule on the tree and shows that the required time to complete a broadcast is significantly reduced in terms of both round numbers and hop counts.
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.
Broadcast with Tree Selection on An Overlay Network
TLDR
A novel protocol is proposed in which a source node selects an efficient tree from multiple spanning trees when broadcasting, which reduces the frequency of inefficient broadcasts for multiple source nodes, and shortens routing paths while maintaining a small number of messages.
Lightweight, efficient, robust epidemic dissemination
Efficient Dissemination Algorithm for Scale-Free Topologies
TLDR
This paper presents an efficient dissemination algorithm suitable for scale-free random topologies which model some complex real world networks and proposes a new gossip algorithm where sites directly connected to hubs do not forward received messages.
Miguel Ângelo Marques de Matos
TLDR
An extensive experimental evaluation is conducted that presents an improvement over an order of magnitude in the number of messages that travers the costlier links, without endagering the resilince and scalability properties that make epidemic based protocols so attractive.
Tree-based Decentralized and Robust Causal Dissemination
TLDR
This dissertation will tackle the challenge of the maximum level of consistency that is possible to provide while remaining available in light of the CAP theorem by exploring how causal broadcast protocols certify the properties discussed above.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 34 REFERENCES
Emergent Structure in Unstructured Epidemic Multicast
TLDR
This paper proposes a novel technique that exploits knowledge about the environment to schedule payload transmission when gossiping, and lets it emerge from the operation of the gossip protocol, which approximates the performance of structured multicast.
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.
HyParView: A Membership Protocol for Reliable Gossip-Based Broadcast
TLDR
This paper presents HyParView, a new membership protocol to support gossip-based broadcast that ensures high levels of reliability even in the presence of high rates of node failure.
GoCast: gossip-enhanced overlay multicast for fast and dependable group communication
TLDR
The goal is to design a protocol that imposes low loads on bottleneck network links and provides both stable throughput and fast delivery of multicast messages even in the presence of frequent node and link failures, and the GoCast protocol is proposed.
NEEM: network-friendly epidemic multicast
TLDR
A novel epidemic protocol whose main characteristic is to be network-friendly is proposed, which is achieved by relying on connection-oriented transport connections, such as TCP/IP, to support the communication among peers.
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.
Low latency probabilistic broadcast in wide area networks
TLDR
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.
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.
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.
Buffer management in probabilistic peer-to-peer communication protocols
  • B. Koldehofe
  • Computer Science
    22nd International Symposium on Reliable Distributed Systems, 2003. Proceedings.
  • 2003
TLDR
This work proposes and evaluates several methods of optimizing the dissemination of events in order to provide high reliability and reduce the number of multiple deliveries at the same time.
...
1
2
3
4
...