Quorums from difference covers

Charles J. Colbourn; Alan C.H. Ling

doi:10.1016/S0020-0190(00)00080-6

Quorums from difference covers

Charles J. Colbourn, Alan C.H. Ling

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

19 Scopus citations

Abstract

Maekawa considered a simple but suboptimal grid-based quorum generation scheme in which N sites in the network are logically organized in the form of a √N×√N grid, and the quorum sets are row-column pairs. Even though the quorum size 2√N of the grid scheme is twice as large as finite projective plane with optimal sized quorums, it has the advantage of being simple and geometrically evident. Agrawal, Egecioglu, and El Abbadi proposed another grid based scheme producing quorums of size √2N. In this note, a very simple construction is given to produce a system of quorums of size √1.5N. These can be generated efficiently.

Original language	English (US)
Pages (from-to)	9-12
Number of pages	4
Journal	Information Processing Letters
Volume	75
Issue number	1
DOIs	https://doi.org/10.1016/S0020-0190(00)00080-6
State	Published - Jul 31 2000
Externally published	Yes

ASJC Scopus subject areas

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

10.1016/S0020-0190(00)00080-6

Fingerprint Dive into the research topics of 'Quorums from difference covers'. Together they form a unique fingerprint.

Cite this

@article{af6b61d51e124657b6aec321e5dd68fd,

title = "Quorums from difference covers",

abstract = "Maekawa considered a simple but suboptimal grid-based quorum generation scheme in which N sites in the network are logically organized in the form of a √N×√N grid, and the quorum sets are row-column pairs. Even though the quorum size 2√N of the grid scheme is twice as large as finite projective plane with optimal sized quorums, it has the advantage of being simple and geometrically evident. Agrawal, Egecioglu, and El Abbadi proposed another grid based scheme producing quorums of size √2N. In this note, a very simple construction is given to produce a system of quorums of size √1.5N. These can be generated efficiently.",

author = "Colbourn, {Charles J.} and Ling, {Alan C.H.}",

note = "Funding Information: Research of the authors is supported by ARO grant DAAG55-98-1-0272 (Colbourn).",

year = "2000",

month = jul,

day = "31",

doi = "10.1016/S0020-0190(00)00080-6",

language = "English (US)",

volume = "75",

pages = "9--12",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - Quorums from difference covers

AU - Colbourn, Charles J.

AU - Ling, Alan C.H.

N1 - Funding Information: Research of the authors is supported by ARO grant DAAG55-98-1-0272 (Colbourn).

PY - 2000/7/31

Y1 - 2000/7/31

N2 - Maekawa considered a simple but suboptimal grid-based quorum generation scheme in which N sites in the network are logically organized in the form of a √N×√N grid, and the quorum sets are row-column pairs. Even though the quorum size 2√N of the grid scheme is twice as large as finite projective plane with optimal sized quorums, it has the advantage of being simple and geometrically evident. Agrawal, Egecioglu, and El Abbadi proposed another grid based scheme producing quorums of size √2N. In this note, a very simple construction is given to produce a system of quorums of size √1.5N. These can be generated efficiently.

AB - Maekawa considered a simple but suboptimal grid-based quorum generation scheme in which N sites in the network are logically organized in the form of a √N×√N grid, and the quorum sets are row-column pairs. Even though the quorum size 2√N of the grid scheme is twice as large as finite projective plane with optimal sized quorums, it has the advantage of being simple and geometrically evident. Agrawal, Egecioglu, and El Abbadi proposed another grid based scheme producing quorums of size √2N. In this note, a very simple construction is given to produce a system of quorums of size √1.5N. These can be generated efficiently.

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

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

U2 - 10.1016/S0020-0190(00)00080-6

DO - 10.1016/S0020-0190(00)00080-6

M3 - Article

AN - SCOPUS:0034229631

VL - 75

SP - 9

EP - 12

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 1

ER -

Quorums from difference covers

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this