Planar quorums

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Abstract

Quorum systems Eire used to implement many coordination problems in distributed systems such as mutual exclusion, data replication, distributed consensus, and commit protocols. This paper presents a new class of quorum systems based on connected regions in planar graphs. This class has an intuitive geometric nature and is easy to visualize and map to the system topology. We show that for triangulated graphs, the resulting quorum systems are non-dominated, which is a desirable property. We study the performance of these systems in terms of their availability, load, and cost of failures. We formally introduce the concept of cost of failures and argue that it is needed to analyze the message complexity of quorum-based protocols. We show that quorums of triangulated graphs with bounded degree have optimal cost of failure. We study a particular member of this class, the triangle lattice. The triangle lattice has small quorum size, optimal load for its size, high availability, and optimal cost of failures. Its parameters are not matched by any other proposed system in the literature. We use percolation theory to study the availability of this system.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages251-268
Number of pages18
Volume1151
ISBN (Print)9783540617693
StatePublished - 1996
Externally publishedYes
Event10th International Workshop on Distributed Algorithms, WDAG 1996 - Bologna, Italy
Duration: Oct 9 1996Oct 11 1996

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1151
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other10th International Workshop on Distributed Algorithms, WDAG 1996
CountryItaly
CityBologna
Period10/9/9610/11/96

Fingerprint

Quorum
Availability
Costs
Triangle
Message Complexity
Data Replication
Percolation Theory
Topology
High Availability
Mutual Exclusion
Graph in graph theory
Planar graph
Distributed Systems
Intuitive

Keywords

  • Cost of failures
  • Distributed systems
  • Fault tolerance
  • Load
  • Percolation
  • Planar graphs
  • Quorum systems

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Bazzi, R. (1996). Planar quorums. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1151, pp. 251-268). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1151). Springer Verlag.

Planar quorums. / Bazzi, Rida.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1151 Springer Verlag, 1996. p. 251-268 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1151).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bazzi, R 1996, Planar quorums. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 1151, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1151, Springer Verlag, pp. 251-268, 10th International Workshop on Distributed Algorithms, WDAG 1996, Bologna, Italy, 10/9/96.
Bazzi R. Planar quorums. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1151. Springer Verlag. 1996. p. 251-268. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Bazzi, Rida. / Planar quorums. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1151 Springer Verlag, 1996. pp. 251-268 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{3ec5680238cf4a03a9642e789f662e87,
title = "Planar quorums",
abstract = "Quorum systems Eire used to implement many coordination problems in distributed systems such as mutual exclusion, data replication, distributed consensus, and commit protocols. This paper presents a new class of quorum systems based on connected regions in planar graphs. This class has an intuitive geometric nature and is easy to visualize and map to the system topology. We show that for triangulated graphs, the resulting quorum systems are non-dominated, which is a desirable property. We study the performance of these systems in terms of their availability, load, and cost of failures. We formally introduce the concept of cost of failures and argue that it is needed to analyze the message complexity of quorum-based protocols. We show that quorums of triangulated graphs with bounded degree have optimal cost of failure. We study a particular member of this class, the triangle lattice. The triangle lattice has small quorum size, optimal load for its size, high availability, and optimal cost of failures. Its parameters are not matched by any other proposed system in the literature. We use percolation theory to study the availability of this system.",
keywords = "Cost of failures, Distributed systems, Fault tolerance, Load, Percolation, Planar graphs, Quorum systems",
author = "Rida Bazzi",
year = "1996",
language = "English (US)",
isbn = "9783540617693",
volume = "1151",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "251--268",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Planar quorums

AU - Bazzi, Rida

PY - 1996

Y1 - 1996

N2 - Quorum systems Eire used to implement many coordination problems in distributed systems such as mutual exclusion, data replication, distributed consensus, and commit protocols. This paper presents a new class of quorum systems based on connected regions in planar graphs. This class has an intuitive geometric nature and is easy to visualize and map to the system topology. We show that for triangulated graphs, the resulting quorum systems are non-dominated, which is a desirable property. We study the performance of these systems in terms of their availability, load, and cost of failures. We formally introduce the concept of cost of failures and argue that it is needed to analyze the message complexity of quorum-based protocols. We show that quorums of triangulated graphs with bounded degree have optimal cost of failure. We study a particular member of this class, the triangle lattice. The triangle lattice has small quorum size, optimal load for its size, high availability, and optimal cost of failures. Its parameters are not matched by any other proposed system in the literature. We use percolation theory to study the availability of this system.

AB - Quorum systems Eire used to implement many coordination problems in distributed systems such as mutual exclusion, data replication, distributed consensus, and commit protocols. This paper presents a new class of quorum systems based on connected regions in planar graphs. This class has an intuitive geometric nature and is easy to visualize and map to the system topology. We show that for triangulated graphs, the resulting quorum systems are non-dominated, which is a desirable property. We study the performance of these systems in terms of their availability, load, and cost of failures. We formally introduce the concept of cost of failures and argue that it is needed to analyze the message complexity of quorum-based protocols. We show that quorums of triangulated graphs with bounded degree have optimal cost of failure. We study a particular member of this class, the triangle lattice. The triangle lattice has small quorum size, optimal load for its size, high availability, and optimal cost of failures. Its parameters are not matched by any other proposed system in the literature. We use percolation theory to study the availability of this system.

KW - Cost of failures

KW - Distributed systems

KW - Fault tolerance

KW - Load

KW - Percolation

KW - Planar graphs

KW - Quorum systems

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

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

M3 - Conference contribution

SN - 9783540617693

VL - 1151

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 251

EP - 268

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -