Epidemic algorithms for replicated database maintenance

Demers, Alan; Greene, Dan; Houser, Carl; Irish, Wes; Larson, John L.; Shenker, Scott; Sturgis, Howard; Swinehart, Dan; Terry, Douglas B.

doi:10.1145/43921.43922

Cited by 599 publications

(835 citation statements)

References 10 publications

Supporting

Mentioning

809

Contrasting

Unclassified

Order By: Relevance

“…With this restriction even maintaining the connectivity of the network becomes a major challenge. This problem and also the problem of information distribution through the DRM is solved using epidemic protocols [5,6].…”

Section: Methodsmentioning

confidence: 99%

A Framework for Distributed Evolutionary Algorithms

Arenas

Collet

Eiben

et al. 2002

Parallel Problem Solving From Nature — PPSN VII

View full text Add to dashboard Cite

Abstract. This paper describes the recently released DREAM (Distributed Resource Evolutionary Algorithm Machine) framework for the automatic distribution of evolutionary algorithm (EA) processing through a virtual machine built from large numbers of individual machines linked by standard Internet protocols. The framework allows five different user entry points which depend on the knowledge and requirements of the user. At the highest level, users may specify and run distributed EAs simply by manipulating graphical displays. At the lowest level the framework turns becomes a P2P (Peer to Peer) mobile agent system, that may be used for the automatic distribution of a class of processes including, but not limited to, EAs.

show abstract

Section: Methodsmentioning

confidence: 99%

A Framework for Distributed Evolutionary Algorithms

Arenas

Collet

Eiben

et al. 2002

Parallel Problem Solving From Nature — PPSN VII

View full text Add to dashboard Cite

show abstract

“…(We have in mind a practical implementation based on a gossip architecture such as [6].) However, to ensure that our implementation in Section 3 can work in bounded space, we need to make one restriction on the pattern of communication: after a replica R α has sent its state to a particular neighbor R β , it should wait until it receives an update message from R β before sending another message of its own to R β .…”

Section: Preliminariesmentioning

confidence: 99%

Agreeing to Agree: Conflict Resolution for Optimistically Replicated Data

Greenwald

Khanna

Kunal

et al. 2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Current techniques for reconciling disconnected changes to optimistically replicated data often use version vectors or related mechanisms to track causal histories. This allows the system to tell whether the value at one replica dominates another or whether the two replicas are in conflict. However, current algorithms do not provide entirely satisfactory ways of repairing conflicts. The usual approach is to introduce fresh events into the causal history, even in situations where the causally independent values at the two replicas are actually equal. In some scenarios these events may later conflict with each other or with further updates, slowing or even preventing convergence of the whole system.To address this issue, we enrich the set of possible actions at a replica to include a notion of explicit conflict resolution between existing events, where the user at a replica declares that one set of events dominates another, or that a set of events are equivalent. We precisely specify the behavior of this refined replication framework from a user's point of view and show that, if communication is assumed to be "reciprocal" (with pairs of replicas exchanging information about their current states), then this specification can be implemented by an algorithm with the property that the information stored at any replica and the sizes of the messages sent between replicas are bounded by a polynomial function of the number of replicas in the system.

show abstract

“…Our alert mechanism belongs to the class of epidemic algorithms (also called gossip protocols) introduced in [12]. In these algorithms, each process chooses to partner processes with which to communicate randomly.…”

Section: Epidemic Algorithmsmentioning

confidence: 99%

Spreading Alerts Quietly and the Subgroup Escape Problem

Aspnes

Diamadi

Gjøsteen

et al. 2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We introduce a new cryptographic primitive called the blind coupon mechanism (BCM). In effect, the BCM is an authenticated bit commitment scheme, which is AND-homomorphic. It has not been known how to construct such commitments before. We show that the BCM has natural and important applications. In particular, we use it to construct a mechanism for transmitting alerts undetectably in a message-passing system of n nodes. Our algorithms allow an alert to quickly propagate to all nodes without its source or existence being detected by an adversary, who controls all message traffic. Our proofs of security are based on a new subgroup escape problem, which seems hard on certain groups with bilinear pairings and on elliptic curves over the ring Zn.

show abstract

Epidemic algorithms for replicated database maintenance

Cited by 599 publications

References 10 publications

A Framework for Distributed Evolutionary Algorithms

A Framework for Distributed Evolutionary Algorithms

Agreeing to Agree: Conflict Resolution for Optimistically Replicated Data

Spreading Alerts Quietly and the Subgroup Escape Problem

Contact Info

Product

Resources

About