Planar quorums

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

Quorum systems are 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 failures. 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)
Pages (from-to)243-268
Number of pages26
JournalTheoretical Computer Science
Volume243
Issue number1-2
StatePublished - Jul 28 2000

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

  • Computational Theory and Mathematics

Cite this

Planar quorums. / Bazzi, Rida.

In: Theoretical Computer Science, Vol. 243, No. 1-2, 28.07.2000, p. 243-268.

Research output: Contribution to journalArticle

Bazzi, R 2000, 'Planar quorums', Theoretical Computer Science, vol. 243, no. 1-2, pp. 243-268.
Bazzi R. Planar quorums. Theoretical Computer Science. 2000 Jul 28;243(1-2):243-268.
Bazzi, Rida. / Planar quorums. In: Theoretical Computer Science. 2000 ; Vol. 243, No. 1-2. pp. 243-268.
@article{92a722bc8fd046d5b53b44e249d65e0a,
title = "Planar quorums",
abstract = "Quorum systems are 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 failures. 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 = "2000",
month = "7",
day = "28",
language = "English (US)",
volume = "243",
pages = "243--268",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "1-2",

}

TY - JOUR

T1 - Planar quorums

AU - Bazzi, Rida

PY - 2000/7/28

Y1 - 2000/7/28

N2 - Quorum systems are 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 failures. 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 are 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 failures. 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=0004352840&partnerID=8YFLogxK

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

M3 - Article

VL - 243

SP - 243

EP - 268

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 1-2

ER -