Stable Leader Election

Aguilera, Marcos K.; Delporte-Gallet, Carole; Fauconnier, Hugues; Toueg, Sam

doi:10.1007/3-540-45414-4_8

Cited by 94 publications

(113 citation statements)

References 11 publications

Supporting

Mentioning

111

Contrasting

Unclassified

Order By: Relevance

“…Here, the privacy-preserving transformation is simply a mean of its inputs (raw data from sources) and we can see that this particular transformation satisfies Equation (1). What is significant, is that Equation (1) establishes a relationship between the transformed value, and obfuscated raw data from sources.…”

Section: Preliminariesmentioning

confidence: 97%

See 1 more Smart Citation

Privacy-Preserving Online Mixing of High Integrity Mobile Multi-user Data

Dua

Bulusu

Feng

2012

Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

View full text Add to dashboard Cite

Abstract. Crowd-sourced sensing systems facilitate unprecedented insight into our local environments by leveraging voluntarily contributed data from the impressive array of smartphone sensors (GPS, audio, image, accelerometer, etc.). However, user participation in crowd-sourced sensing will be inhibited if people cannot trust the system to maintain their privacy. On the other hand, data modified for privacy may be of limited use to the system without mechanisms to verify integrity. In this paper, we present an interactive proof protocol that allows an intermediary to convince a data consumer that it is accurately performing a privacy-preserving transformation mixing inputs from multiple expected sources, but without revealing those inputs. Additionally, we discuss privacy transformation functions that are compatible with the protocol, and show that the protocol introduces very little overhead, making it ideal for real-time crowd-sourced data collection.

show abstract

Section: Preliminariesmentioning

confidence: 97%

“…For secure communication among sources, a group key will need to be established [12]. To reliably elect a leader, a communication-efficient stable leader election protocol can be used [1].…”

Section: Protocol Detailsmentioning

confidence: 99%

Privacy-Preserving Online Mixing of High Integrity Mobile Multi-user Data

Dua

Bulusu

Feng

2012

Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

View full text Add to dashboard Cite

show abstract

“…Most leader election algorithms are, however, oblivious to the application needs and elect a leader based on its id, e.g., the highest id in the alive-set of each process [9], or the next id when incrementing a counter [1,5]. In fact, leader election has been proposed as a service for multiple applications at the same time [9,18].…”

Section: Related Workmentioning

confidence: 99%

“…Many existing leader election algorithms rely on the identifiers of servers to select a leader [1,9,11]. While designing ZooKeeper, however, one initial requirement regarding leader election was the ability to elect the server with the longest history of state updates among a quorum of servers.…”

Section: Introductionmentioning

confidence: 99%

Leader Election for Replicated Services Using Application Scores

2011

View full text Add to dashboard Cite

Abstract. Replicated services often rely on a leader to order client requests and broadcast state updates. In this work, we present POLE, a leader election algorithm that select leaders using application-specific scores. This flexibility given to the application enables the algorithm to tailor leader election according to metrics that are relevant in practical settings and that have been overlooked by existing approaches. Recovery time and request latency are examples of such metrics. To evaluate POLE, we use ZooKeeper, an open-source replicated service used for coordinating Web-scale applications. Our evaluation over realistic widearea settings shows that application scores can have a significant impact on performance, and that just optimizing the latency of consensus does not translate into lower latency for clients. An important conclusion from our results is that obtaining a general strategy that satisfies a wide range of requirements is difficult, which implies that configurability is indispensable for practical leader election.

show abstract

“…It has long been held that failure detectors encapsulate partial synchrony. More precisely, a failure detector D encapsulates a partially synchronous system model M if and only if the following two conditions hold: (1) every problem solvable in an asynchronous system augmented with D is also solvable in system model M, and (2) every problem solvable in system model M is also solvable in an asynchronous system augmented with D. As such, if D encapsulates M, then D is substitutable for M because any problem solvable in M is also solvable in asynchrony augmented with D. Alternatively (and informally), the notion of encapsulation by a failure detector may be viewed synonymously with the notion of mutual reducibility; that is, a failure detector D encapsulates a system model M if and only if (1) there exists an algorithm that implements D in system model M, and (2) there exists an asynchronous algorithm that queries D and implements a 'virtual' system that satisfies the properties of M.…”

Section: Introductionmentioning

confidence: 99%

Failure Detectors Encapsulate Fairness

Pike

Sastry

Welch

2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Failure detectors have long been viewed as abstractions for the synchronism present in distributed system models. However, investigations into the exact amount of synchronism encapsulated by a given failure detector have met with limited success. The reason for this is that traditionally, models of partial synchrony are specified with respect to real time, but failure detectors do not encapsulate real time. Instead, we argue that failure detectors encapsulate the fairness in computation and communication. Fairness is a measure of the number of steps executed by one process relative either to the number of steps taken by another process or relative to the duration for which a message is in transit. We argue that failure detectors are substitutable for the fairness properties (rather than real-time properties) of partially synchronous systems. We propose four fairness-based models of partial synchrony and demonstrate that they are, in fact, the 'weakest system models' to implement the canonical failure detectors from the Chandra-Toueg hierarchy. We also propose a set of fairness-based models which encapsulate the G c parametric failure detectors which eventually and permanently suspect crashed processes, and eventually and permanently trust some fixed set of c correct processes.

show abstract

Stable Leader Election

Cited by 94 publications

References 11 publications

Privacy-Preserving Online Mixing of High Integrity Mobile Multi-user Data

Privacy-Preserving Online Mixing of High Integrity Mobile Multi-user Data

Leader Election for Replicated Services Using Application Scores

Failure Detectors Encapsulate Fairness

Contact Info

Product

Resources

About