Geographic quorum system approximations

Paz Carmi; Shlomi Dolev; Sariel Har-Peled; Matthew J. Katz; Michael Segal

doi:10.1007/s00453-004-1130-1

Geographic quorum system approximations

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

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

10 Scopus citations

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 Χ 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 Χ 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.

Original language	English
Pages (from-to)	233-244
Number of pages	12
Journal	Algorithmica
Volume	41
Issue number	4
DOIs	https://doi.org/10.1007/s00453-004-1130-1
State	Published - 1 Feb 2005

Keywords

Clustering
Geometric optimization
Quorum system

ASJC Scopus subject areas

General Computer Science
Computer Science Applications
Applied Mathematics

Access to Document

10.1007/s00453-004-1130-1

Cite this

@article{4ebf495b63c7408eb6c70068928ed7ff,

title = "Geographic quorum system approximations",

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 Χ 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 Χ 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.",

keywords = "Clustering, Geometric optimization, Quorum system",

author = "Paz Carmi and Shlomi Dolev and Sariel Har-Peled and Katz, {Matthew J.} and Michael Segal",

year = "2005",

month = feb,

day = "1",

doi = "10.1007/s00453-004-1130-1",

language = "English",

volume = "41",

pages = "233--244",

journal = "Algorithmica",

issn = "0178-4617",

publisher = "Springer New York",

number = "4",

}

TY - JOUR

T1 - Geographic quorum system approximations

AU - Carmi, Paz

AU - Dolev, Shlomi

AU - Har-Peled, Sariel

AU - Katz, Matthew J.

AU - Segal, Michael

PY - 2005/2/1

Y1 - 2005/2/1

N2 - 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 Χ 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 Χ 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.

AB - 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 Χ 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 Χ 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.

KW - Clustering

KW - Geometric optimization

KW - Quorum system

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

U2 - 10.1007/s00453-004-1130-1

DO - 10.1007/s00453-004-1130-1

M3 - Article

AN - SCOPUS:13644254145

SN - 0178-4617

VL - 41

SP - 233

EP - 244

JO - Algorithmica

JF - Algorithmica

IS - 4

ER -

Geographic quorum system approximations

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this