A Gossip-Style Failure Detection Service

By Robbert van Renesse, Yaron Minsky, Mark Hayden. 2009

611 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/695a10a91b559e5caec2931f474e6132c7ef4299

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

Citations in the corpus

Want to scale in centralized systems? Think P2P (2015, methodology): “This includes distributed objects [61], component-based middleware [62], modular distributed platforms [43, 63–65], aspects [66], reflection [67], and models at runtime approaches [68, 69] just to name of few.”
Ef £ cient PDA Synchronization (2002, background): “Moreover, the successful implementation of this protocol on the computationally and communicationally limited Palm device suggests that the same can be done for more complicated, heterogeneous networks of many machines.”
Spatial gossip and resource location protocols (2001, background): “For nodes arranged with uniform density in Euclidean space, we present natural gossip mechanisms, called spatial gossip, that satisfy such a guarantee: new information is spread to nodes at distance d, with high probability, in O(log1+e d) time steps.”
Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining (2003, background): “/2143'5 should grow logarithmically with membership size (see [32]), which in turn can be determined from the nmembers attribute.”
Peer-to-Peer Membership Management for Gossip-Based Protocols (2003, methodology): “They have been used in various contexts such as publish-subscribe systems [12], distributed databases [10], distributed failure detection [26], distributed resource location [25], and virtual synchrony [15].”
Gossip-based peer sampling (2007, background): “Ideally, any given node should exchange information with peers that are selected following a uniform random sample of all nodes currently in the system [Demers et al. 1987; van Renesse et al. 1998; Birman et al. 1999; Karp et al. 2000; Sun and Sturman 2000; Kowalczyk and Vlassis 2005].”
Efficient PDA Synchronization (2003, background): “resource availability [17,18], data within gossip protocols [ 19 ,20], or memos and address books.”
Kelips: Building an Efficient and Stable P2P DHT through Increased Memory and Background Overhead (2003, background): “Heartbeat updates originate at the responsible node (for filetuples, this is the homenode) and are disseminated through a peer-to-peer Epidemic protocol [7].”
Connectivity and inference problems for temporal networks (2000, background): “has been exploited in the design of protocols for distributed systems [5, 16].”
Gossip-based aggregation in large dynamic networks (2005, background): “Examples include database replication [3] and failure detection [27].”
Lightweight probabilistic broadcast (2001, methodology): “detection based on gossips [ 29 ], while a third paper describ es Capt’n Cook [28], a gossip-based resource location protocol for the Internet, which can in that sense be seen as a membership protocol.6 This protocol enables the”
On the quality of service of failure detectors (2000, background): “(many such variations exist in practice [10, 19, 28]).”