Skip to main content
Log in

Geographic Quorum System Approximations

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

Quorum systems are a mechanism for obtaining fault-tolerance and efficient distributed systems. We consider geographic quorum systems; a geographic quorum system is a partition of a set X of sites in the plane (representing servers) into quorums (i.e., clusters) of size k. The distance between a point p and a cluster C is the Euclidean distance between p and the site in C that is the farthest from p. We present a near linear time constant-factor approximation algorithm for partitioning X into clusters, such that the maximal distance between a point in the underlying region and its closest cluster is minimized. Next, we describe a data structure for answering (approximately) nearest-neighbor queries on such a clustering. Finally, we study the problem of partitioning into clusters with an additional load-balancing requirement.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Paz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew J. Katz or Michael Segal.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Carmi, P., Dolev, S., Har-Peled, S. et al. Geographic Quorum System Approximations. Algorithmica 41, 233–244 (2005). https://doi.org/10.1007/s00453-004-1130-1

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-004-1130-1

Navigation