Gossip-Based Broadcast
نویسندگان
چکیده
Gossip, or epidemic, protocols have emerged as a powerful strategy to implement highly scalable and resilient reliable broadcast primitives on large scale peer-to-peer networks. Epidemic protocols are scalable because they distribute the load among all nodes in the system and resilient because they have an intrinsic level of redundancy that masks node and network failures. This chapter provides an introduction to gossip-based broadcast on largescale 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, named HyParView and Plumtree. The original publication is available at www.springerlink.com http://www.springer.com/engineering/signals/book/978-0-387-09750-3
منابع مشابه
Reliable Gossip-Based Broadcast Protocol in Mobile Ad Hoc Networks
Based on existing reliable broadcast protocols in MANETs, we propose a novel reliable broadcast protocol that uses clustering technique and gossip methodology. We combine local retransmission and gossip mechanisms to provide reliability in MANETs. The proposed protocol can dynamically change system parameters for reliable broadcast communication in order to improve the adaptability in the rapid...
متن کاملAdaptive Gossip-Based Broadcast
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 nodes within the same broadcast group and 2) to the global level of congestion in the system. The adaptation mechanism can be applied to all gossip-based broadcast algorithms we know of and makes their...
متن کاملProbabilistic Multicast
Gossip-based broadcast algorithms have been considered as a viable alternative to traditional deterministic reliable broadcast algorithms in large scale environments. However, these algorithms focus on broadcasting events inside a large group of processes, while the multicasting of events to a subset of processes in a group only, potentially varying for every event, has not been considered. We ...
متن کاملAdaptive gossip protocols: Managing security and redundancy in dense ad hoc networks
Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but because of its extreme redundancy, it is impractical in dense networks. Indeed in large wireless networks, the use of flooding algorithms may lead to broadcast storms where the number of collisions is so large that it causes sys...
متن کاملReducing Noise in Gossip-Based Reliable Broadcast
We present in this paper a general garbage collection scheme that reduces the “noise” in gossip-based broadcast algorithms. In short, our garbage collection scheme uses a simple heuristic to trade “useless” messages with “useful” ones. Used with a given gossip-based broadcast algorithm, a given size of buffers, and a given number of disseminated messages (e.g., per gossip round), our garbage co...
متن کامل