Title :
A general method to define quorums
Author :
Neilsen, Mitchell L. ; Mizuno, Masaaki ; Raynal, Michel
Author_Institution :
Dept. of Comput. & Inf. Sci., Kansas State Univ., Manhattan, KS, USA
Abstract :
Composition, a general method for constructing quorum sets, coteries, and bicoteries, is discussed. It is shown that composition provides a natural method for constructing quorum structures in an arbitrary network or even in a collection of interconnected networks, and that the resulting structures, called composite structures, can be efficiently evaluated. In particular, an efficient method for determining if a given set contains a quorum of a composite structure is presented. If this method is used, it is not necessary to compute and store all of the quorums of the composite structure in advance
Keywords :
protocols; bicoteries; composite structures; composition; coteries; interconnected networks; protocols; quorum sets; Availability; Boolean functions; Communication system control; Data structures; Game theory; Nominations and elections; Protocols; Reliability theory; Set theory; Voting;
Conference_Titel :
Distributed Computing Systems, 1992., Proceedings of the 12th International Conference on
Conference_Location :
Yokohama
Print_ISBN :
0-8186-2865-0
DOI :
10.1109/ICDCS.1992.235110