How to be an efficient snoop, or the probe complexity of quorum systems

David Peleg*, Avishai Wool

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mutual exclusion, data replication, and dissemination of information. When the elements may fail, a user of a distributed protocol needs to quickly find a quorum all of whose elements are alive or evidence that no such quorum exists. This is done by probing the system elements, one at a time, to determine if they are alive or dead. This paper studies the probe complexity PC(S) of a quorum system S, defined as the worst case number of probes required to find a live quorum or to show its nonexistence in S, using the best probing strategy. We show that for large classes of quorum systems, all n elements must be probed in the worst case. Such systems are called evasive. However, not all quorum systems are evasive; we demonstrate a system where O(log n) probes always suffice. Then we prove two lower bounds on the probe complexity in terms of the minimal quorum cardinality c(S) and the number of minimal quorums m(S). Finally, we show a universal probe strategy which never makes more than c(S)2 - c(S) + 1 probes; thus any system with c(S) ≤ √n is nonevasive.

Original languageEnglish
Pages (from-to)416-433
Number of pages18
JournalSIAM Journal on Discrete Mathematics
Volume15
Issue number3
DOIs
StatePublished - May 2002

Keywords

  • Distributed computing
  • Evasiveness
  • Quorum systems
  • Strong and simple games

Fingerprint

Dive into the research topics of 'How to be an efficient snoop, or the probe complexity of quorum systems'. Together they form a unique fingerprint.

Cite this