On the reliability of consensus-based fault-tolerant distributed computing systems
ACM Transactions on Computer Systems (TOCS)
SIAM Journal on Applied Mathematics
Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Concurrent programming: principles and practice
Concurrent programming: principles and practice
Managing update conflicts in Bayou, a weakly connected replicated storage system
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
A reliable multicast framework for light-weight sessions and application level framing
IEEE/ACM Transactions on Networking (TON)
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
The Timed Asynchronous Distributed System Model
IEEE Transactions on Parallel and Distributed Systems
ACM Transactions on Computer Systems (TOCS)
Byzantine generals in action: implementing fail-stop processors
ACM Transactions on Computer Systems (TOCS)
The Combinatorics of Network Reliability
The Combinatorics of Network Reliability
Directional Gossip: Gossip in a Wide Area Network
EDCC-3 Proceedings of the Third European Dependable Computing Conference on Dependable Computing
RTCAST: lightweight multicast for real-time process groups
RTAS '96 Proceedings of the 2nd IEEE Real-Time Technology and Applications Symposium (RTAS '96)
A low-cost processor group membership protocol for a hard real-time distributed system
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Probabilistic Broadcast
GSGC: An Efficient Gossip-Style Garbage Collection Scheme for Scalable Reliable Multicast
GSGC: An Efficient Gossip-Style Garbage Collection Scheme for Scalable Reliable Multicast
Gossip versus Deterministic Flooding: Low Message Overhead and High Reliability for Broadcasting on Small Networks
THE PERFORMANCE OF WEAK-CONSISTENCY REPLICATION PROTOCOLS
THE PERFORMANCE OF WEAK-CONSISTENCY REPLICATION PROTOCOLS
Exploiting trade-offs in the design of fault-tolerant distributed databases
Exploiting trade-offs in the design of fault-tolerant distributed databases
A gossip-style failure detection service
Middleware '98 Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Peer-to-Peer Membership Management for Gossip-Based Protocols
IEEE Transactions on Computers
SCAMP: Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
Probabilistic Reliable Dissemination in Large-Scale Systems
IEEE Transactions on Parallel and Distributed Systems
Lightweight probabilistic broadcast
ACM Transactions on Computer Systems (TOCS)
IEEE Transactions on Dependable and Secure Computing
Efficient and Adaptive Epidemic-Style Protocols for Reliable and Scalable Multicast
IEEE Transactions on Parallel and Distributed Systems
Fireflies: scalable support for intrusion-tolerant network overlays
Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
Peer-to-Peer in Metric Space and Semantic Space
IEEE Transactions on Knowledge and Data Engineering
Proceedings of the 16th international symposium on High performance distributed computing
Improving denial of service resistance using dynamic local adaptations
Proceedings of the 2008 ACM symposium on Applied computing
Efficient Processing of Continuous Join Queries Using Distributed Hash Tables
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Araneola: A scalable reliable multicast system for dynamic environments
Journal of Parallel and Distributed Computing
Hybrid dissemination: adding determinism to probabilistic multicasting in large-scale P2P systems
Proceedings of the ACM/IFIP/USENIX 2007 International Conference on Middleware
Investigating the existence and the regularity of Logarithmic Harary Graphs
Theoretical Computer Science
Counter-based reliability optimization for gossip-based broadcasting
Computer Communications
DHT-based lightweight broadcast algorithms in large-scale computing infrastructures
Future Generation Computer Systems
Hybrid dissemination: adding determinism to probabilistic multicasting in large-scale P2P systems
MIDDLEWARE2007 Proceedings of the 8th ACM/IFIP/USENIX international conference on Middleware
Development of the wireless embedded sensor network for energy-efficient flooding
Proceedings of the 2011 ACM Symposium on Applied Computing
Reliable multicast and its probabilistic model for job submission in peer-to-peer grids
WISE'05 Proceedings of the 6th international conference on Web Information Systems Engineering
Improving the robustness of epidemic communication in scale-free networks
BioADIT'06 Proceedings of the Second international conference on Biologically Inspired Approaches to Advanced Information Technology
Hi-index | 0.01 |
Rumor mongering (also known as gossip) is an epidemiological protocol that implements broadcasting with a reliability that can be very high. Rumor mongering is attractive because it is generic, scalable, adapts well to failures and recoveries, and has a reliability that gracefully degrades with the number of failures in a run. However, rumor mongering uses random selection for communications. We study the impact of using random selection in this paper. We present a protocol that superficially resembles rumor mongering but is deterministic. We show that this new protocol has most of the same attractions as rumor mongering. The one remaining attraction that rumor mongering has over the determinisitic protocol--namely graceful degradation--comes at a high cost in terms of the number of messages sent. We compare the two approaches both at an abstract level and in terms of how they perform in an Ethernet and small wide area network of Ethernets.