Issue No. 01 - January (1997 vol. 8)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.569655
<p><b>Abstract</b>—Given a set of nodes <it>S</it>, a <it>coterie</it> is a set of pairwise intersecting subsets of <it>S</it>. Each element in a coterie is called a <it>quorum</it>. Mutual exclusion in a distributed system can be achieved if each request is required to get consensus from a quorum of nodes. This technique of quorum consensus is also used for replicated distributed database systems, and <it>bicoteries</it> and <it>wr-coteries</it> have been defined to capture the requirements of read and write operations in user transactions. In this paper, we are interested in finding coteries, bicoteries, and wr-coteries with optimal communication delay. The protocols take into account the network topology. We design delay-optimal quorum consensus protocols for network topologies of trees, rings, and clustered networks.</p>
Mutual exclusion, quorum consensus, wide-area networks, distributed systems, replicated database systems, coteries, communication delay, network topology.
Ada Waichee Fu, "Delay-Optimal Quorum Consensus for Distributed Systems", IEEE Transactions on Parallel & Distributed Systems, vol. 8, no. , pp. 59-69, January 1997, doi:10.1109/71.569655