Generalized tree quorum protocol

An efficient approach for managing replicated data

D. Agrawal, A. El Abbadi

Research output: Contribution to journalArticle

57 Citations (Scopus)

Abstract

In this paper, we present a low-cost fault-tolerant protocol for managing replicated data. We impose a logical tree structure on the set of copies of an object and develop a protocol that uses the information available in the logical structure to reduce the communication requirements for read and write operations. The tree quorum protocol is a generalization of the static voting protocol with two degrees of freedom for choosing quorums. In general, this results in significantly lower communication costs for comparable data availability. The protocol exhibits the property of graceful degradation, i.e., communication costs for executing operations are minimal in a failure-free environment but may increase as failures occur. This approach in designing distributed systems is desirable since it provides fault-tolerance without imposing unnecessary costs on the failure-free mode of operations.

Original languageEnglish
Pages (from-to)689-717
Number of pages29
JournalACM Transactions on Database Systems
Volume17
Issue number4
DOIs
Publication statusPublished - 1 Dec 1992
Externally publishedYes

Fingerprint

Costs
Communication
Fault tolerance
Availability
Degradation

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Information Systems
  • Software

Cite this

Generalized tree quorum protocol : An efficient approach for managing replicated data. / Agrawal, D.; El Abbadi, A.

In: ACM Transactions on Database Systems, Vol. 17, No. 4, 01.12.1992, p. 689-717.

Research output: Contribution to journalArticle

@article{7e84d14d82ed4800b2f086c078ae66bf,
title = "Generalized tree quorum protocol: An efficient approach for managing replicated data",
abstract = "In this paper, we present a low-cost fault-tolerant protocol for managing replicated data. We impose a logical tree structure on the set of copies of an object and develop a protocol that uses the information available in the logical structure to reduce the communication requirements for read and write operations. The tree quorum protocol is a generalization of the static voting protocol with two degrees of freedom for choosing quorums. In general, this results in significantly lower communication costs for comparable data availability. The protocol exhibits the property of graceful degradation, i.e., communication costs for executing operations are minimal in a failure-free environment but may increase as failures occur. This approach in designing distributed systems is desirable since it provides fault-tolerance without imposing unnecessary costs on the failure-free mode of operations.",
author = "D. Agrawal and {El Abbadi}, A.",
year = "1992",
month = "12",
day = "1",
doi = "10.1145/146931.146935",
language = "English",
volume = "17",
pages = "689--717",
journal = "ACM Transactions on Database Systems",
issn = "0362-5915",
publisher = "Association for Computing Machinery (ACM)",
number = "4",

}

TY - JOUR

T1 - Generalized tree quorum protocol

T2 - An efficient approach for managing replicated data

AU - Agrawal, D.

AU - El Abbadi, A.

PY - 1992/12/1

Y1 - 1992/12/1

N2 - In this paper, we present a low-cost fault-tolerant protocol for managing replicated data. We impose a logical tree structure on the set of copies of an object and develop a protocol that uses the information available in the logical structure to reduce the communication requirements for read and write operations. The tree quorum protocol is a generalization of the static voting protocol with two degrees of freedom for choosing quorums. In general, this results in significantly lower communication costs for comparable data availability. The protocol exhibits the property of graceful degradation, i.e., communication costs for executing operations are minimal in a failure-free environment but may increase as failures occur. This approach in designing distributed systems is desirable since it provides fault-tolerance without imposing unnecessary costs on the failure-free mode of operations.

AB - In this paper, we present a low-cost fault-tolerant protocol for managing replicated data. We impose a logical tree structure on the set of copies of an object and develop a protocol that uses the information available in the logical structure to reduce the communication requirements for read and write operations. The tree quorum protocol is a generalization of the static voting protocol with two degrees of freedom for choosing quorums. In general, this results in significantly lower communication costs for comparable data availability. The protocol exhibits the property of graceful degradation, i.e., communication costs for executing operations are minimal in a failure-free environment but may increase as failures occur. This approach in designing distributed systems is desirable since it provides fault-tolerance without imposing unnecessary costs on the failure-free mode of operations.

UR - http://www.scopus.com/inward/record.url?scp=0027002360&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027002360&partnerID=8YFLogxK

U2 - 10.1145/146931.146935

DO - 10.1145/146931.146935

M3 - Article

VL - 17

SP - 689

EP - 717

JO - ACM Transactions on Database Systems

JF - ACM Transactions on Database Systems

SN - 0362-5915

IS - 4

ER -