A new quorum-based replica control protocol
- 23 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Data replication is an important issue in distributed systems. Many protocols are designed to achieve high availability, but some of them have restrictions on N, the number of nodes in the system. This motivates us to design a protocol suitable for arbitrary N. In this paper, we present a new quorum-based replica control protocol whose quorum size is O(/spl radic//N), which is the same as that of the grid protocol. Moreover; the proposed protocol is almost symmetric, i.e., each node nearly bears the same responsibility. In particular, our protocol performs well in systems where read operations are requested more frequently than write ones.Keywords
This publication has 9 references indexed in Scilit:
- The grid protocol: a high performance scheme for maintaining replicated dataIEEE Transactions on Knowledge and Data Engineering, 1992
- A high availability √N hierarchical grid algorithm for replicated dataInformation Processing Letters, 1991
- Hierarchical quorum consensus: a new algorithm for managing replicated dataIEEE Transactions on Computers, 1991
- An efficient and fault-tolerant solution for distributed mutual exclusionACM Transactions on Computer Systems, 1991
- Exploiting logical structures in replicated databasesInformation Processing Letters, 1990
- Consistency and recovery control for replicated filesPublished by Association for Computing Machinery (ACM) ,1985
- Fail-stop processorsACM Transactions on Computer Systems, 1983
- A Majority consensus approach to concurrency control for multiple copy databasesACM Transactions on Database Systems, 1979
- Weighted voting for replicated dataPublished by Association for Computing Machinery (ACM) ,1979