2007 · 82 citations · 22 references
ComputingComputer EngineeringComputer ScienceDistributed SystemsFault-tolerant ComputingFault-tolerant SystemsBroadcast CommunicationData RedundancyFault Tolerance In CommunicationFault-tolerant CommunicationReliable Distributed SystemsBroadcastBroadcast AlgorithmsEpidemic ProtocolsFault-tolerant Gossip ProtocolsGossip AlgorithmsMessage ComplexityMessage Complexity In Distributed ComputationResilience
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. The protocol sends the message payload preferably via tree branches but uses the remaining links of the gossip overlay for fast recovery and expedite tree healing. Experimental evaluation presented in the paper shows that our new strategy has a low overhead and that is able to support large number of faults while maintaining a high reliability.
22
Epidemic algorithms for replicated database maintenance
Alan Demers, Dan Greene, Carl Hauser et al. · 1987 · 1.7K citations · Full text
Brent Chun, David Culler, Timothy Roscoe et al. · ACM SIGCOMM Computer Communication Review · 2003 · 1K citations