The Reliability of Voting Mechanisms

Барбара,; Garcia-Molina,

doi:10.1109/tc.1987.1676860

Cited by 112 publications

(38 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The notion of availability we use here (crash probability) is well known in reliability theory [BP75] and has been applied extensively in the analysis of quorum systems (cf. [BG87,PW95,PW97a] and the references therein). The load of a quorum system was first defined and analyzed in [NW98], which proved a lower bound of Ω(…”

Section: Related Workmentioning

confidence: 99%

The load and availability of Byzantine quorum systems

Malkhi

Reiter

Wool³

1997

Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing - PODC '97

View full text Add to dashboard Cite

Replicated services accessed via quorums enable each access to be performed at only a subset (quorum) of the servers, and achieve consistency across accesses by requiring any two quorums to intersect. Recently, b-masking quorum systems, whose intersections contain at least 2b+1 servers, have been proposed to construct replicated services tolerant of b arbitrary (Byzantine) server failures. In this paper we consider a hybrid fault model allowing benign failures in addition to the Byzantine ones. We present four novel constructions for b-masking quorum systems in this model, each of which has optimal load (the probability of access of the busiest server) or optimal availability (probability of some quorum surviving failures). To show optimality we also prove lower bounds on the load and availability of any b-masking quorum system in this model.

show abstract

Section: Related Workmentioning

confidence: 99%

The load and availability of Byzantine quorum systems

Malkhi

Reiter

Wool³

1997

Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing - PODC '97

View full text Add to dashboard Cite

show abstract

“…Nondominance concerns if a quorum system can be further improved to increase its failure resilience. Availability [4,49,55], on the other hand, quantizes the measurement of fault tolerance: given a failure probability to each node, what is the probability that none of a complete quorum survives? Moreover, load [49] measures the probability that the busiest node is accessed under the best possible strategy for accessing quorums.…”

Section: Related Workmentioning

confidence: 99%

“…A coterie C that dominates another coterie D is more failure resilient than D, but it is not necessarily more failure resilient than a coterie E it does not dominate. Therefore, the notion of availability [4,49,55] has been proposed to quantize fault tolerance, which measures the probability that all quorums in a coterie are hit given a failure probability to each node. In general, nondominance is useful to determine whether a quorum system can be improved to increase its failure resilience, while availability is more useful for comparing different quorum systems.…”

Section: Lemma 7 Letmentioning

confidence: 99%

On quorum systems for group resources allocation

Joung

2010

Distrib. Comput.

View full text Add to dashboard Cite

We present a problem, called (n, m, k, d)-resource allocation, to model allocation of group resources with bounded capacity. Specifically, the problem concerns the scheduling of k identical resources among n processes which belong to m groups. Each resource can be used by at most d processes of the same group at a time, but no two processes of different groups can use a resource simultaneously. The problem captures two fundamental types of conflicts in mutual exclusion: k-exclusion's amount constraint on the number of processes that can share a resource, and group mutual exclusion's type constraint on the class of processes that can share a resource. We then study the problem in the message passing paradigm, and investigate quorum systems for the problem. We begin by establishing some basic and general results for quorum systems for the case of k = 1, based on which quorum systems for the general case can be understood and constructed. We found that the study of quorum systems for (n, m, 1, d)-resource allocation is related to some classical problems in combinatorics and in finite projective geometries. By applying the results there, we are able to obtain some optimal/near-optimal quorum systems.

show abstract

“…Steps (2) through (9) are iterated until there is at least one replica that covers all the replicas uncovered by any replica i ∈ R in T s . One of these replicas that covers all the replicas uncovered by any replica is added to to R by step (10), and then the algorithm terminates. An example operation of the OVDC method is shown in Fig.…”

Section: Calculation Of a Minimum Readmentioning

confidence: 99%

Scalable Load Distribution for View Divergence Control of Data Freshness in Replicated Database Systems

Yamashita

2006

ipsjdc

View full text Add to dashboard Cite

A scalable load distribution method for view divergence control of statistically defined data freshness in replicated database systems is proposed. This method enables a number of mobile and fixed client nodes to continue their processes even when they lose connectivity to a network or do not have sufficient bandwidth to meet application requirements, which is very likely to occur to mobile client nodes. This can be achieved by renewing copies of data in client nodes while they maintain connectivity to a network so that their copies of data are sufficiently fresh to meet application requirements while they lose network connectivity. The load distribution for view divergence control is achieved by determining multiple sets of replicas from which client nodes retrieve the values of data through read transactions. Client nodes calculate the value of data that reflect updates which have already reached one or more elements in the determined set of replicas. We show that our method reduces the load of processing read transactions to less than about 1/40 of that in the original method in order to improve data freshness to about 2/5 of the maximum update delay in a large-scale network.

show abstract

The Reliability of Voting Mechanisms

Cited by 112 publications

References 8 publications

The load and availability of Byzantine quorum systems

The load and availability of Byzantine quorum systems

On quorum systems for group resources allocation

Scalable Load Distribution for View Divergence Control of Data Freshness in Replicated Database Systems

Contact Info

Product

Resources

About