Planar quorums

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

8 Scopus citations

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 publicationDistributed Algorithms - 10th International Workshop, WDAG 1996, Proceedings
EditorsOzalp Babaoglu, Keith Marzullo
PublisherSpringer Verlag
Pages251-268
Number of pages18
ISBN (Print)9783540617693
DOIs
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)0302-9743
ISSN (Electronic)1611-3349

Other

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

Keywords

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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Planar quorums'. Together they form a unique fingerprint.

  • Cite this

    Bazzi, R. A. (1996). Planar quorums. In O. Babaoglu, & K. Marzullo (Eds.), Distributed Algorithms - 10th International Workshop, WDAG 1996, Proceedings (pp. 251-268). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1151). Springer Verlag. https://doi.org/10.1007/3-540-61769-8_17