Probabilistic quorum systems in wireless ad hoc networks

Roy Friedman; Gabriel Kliot; Chen Avin

doi:10.1109/DSN.2008.4630096

Probabilistic quorum systems in wireless ad hoc networks

Roy Friedman, Gabriel Kliot, Chen Avin

Research output: Contribution to conference › Paper › peer-review

12 Scopus citations

Abstract

Quorums are a basic construct in solving many fundamental distributed computing problems. One of the known ways of making quorums scalable and efficient is by weakening their intersection guarantee to being probabilistic. This paper explores several access strategies for implementing probabilistic quorums in ad hoc networks. In particular, we present the first detailed study of asymmetric probabilistic bi-quorum systems and show its advantages in ad hoc networks. The paper includes both a formal analysis of these approaches backed by a simulation based study. In particular, we show that one of the strategies, based on Random Walks, exhibits the smallest communication overhead.

Original language	English
Pages	277-286
Number of pages	10
DOIs	https://doi.org/10.1109/DSN.2008.4630096
State	Published - 13 Oct 2008
Event	2008 International Conference on Dependable Systems and Networks, DSN-2008 - Anchorage, AK, United States Duration: 24 Jun 2008 → 27 Jun 2008

Conference

Conference	2008 International Conference on Dependable Systems and Networks, DSN-2008
Country/Territory	United States
City	Anchorage, AK
Period	24/06/08 → 27/06/08

ASJC Scopus subject areas

Software
Hardware and Architecture
Computer Networks and Communications

Access to Document

10.1109/DSN.2008.4630096

Cite this

@conference{5ca6cfb9577f40eb9c2a2d3196a175e4,

title = "Probabilistic quorum systems in wireless ad hoc networks",

abstract = "Quorums are a basic construct in solving many fundamental distributed computing problems. One of the known ways of making quorums scalable and efficient is by weakening their intersection guarantee to being probabilistic. This paper explores several access strategies for implementing probabilistic quorums in ad hoc networks. In particular, we present the first detailed study of asymmetric probabilistic bi-quorum systems and show its advantages in ad hoc networks. The paper includes both a formal analysis of these approaches backed by a simulation based study. In particular, we show that one of the strategies, based on Random Walks, exhibits the smallest communication overhead.",

author = "Roy Friedman and Gabriel Kliot and Chen Avin",

year = "2008",

month = oct,

day = "13",

doi = "10.1109/DSN.2008.4630096",

language = "English",

pages = "277--286",

note = "2008 International Conference on Dependable Systems and Networks, DSN-2008 ; Conference date: 24-06-2008 Through 27-06-2008",

}

TY - CONF

T1 - Probabilistic quorum systems in wireless ad hoc networks

AU - Friedman, Roy

AU - Kliot, Gabriel

AU - Avin, Chen

PY - 2008/10/13

Y1 - 2008/10/13

N2 - Quorums are a basic construct in solving many fundamental distributed computing problems. One of the known ways of making quorums scalable and efficient is by weakening their intersection guarantee to being probabilistic. This paper explores several access strategies for implementing probabilistic quorums in ad hoc networks. In particular, we present the first detailed study of asymmetric probabilistic bi-quorum systems and show its advantages in ad hoc networks. The paper includes both a formal analysis of these approaches backed by a simulation based study. In particular, we show that one of the strategies, based on Random Walks, exhibits the smallest communication overhead.

AB - Quorums are a basic construct in solving many fundamental distributed computing problems. One of the known ways of making quorums scalable and efficient is by weakening their intersection guarantee to being probabilistic. This paper explores several access strategies for implementing probabilistic quorums in ad hoc networks. In particular, we present the first detailed study of asymmetric probabilistic bi-quorum systems and show its advantages in ad hoc networks. The paper includes both a formal analysis of these approaches backed by a simulation based study. In particular, we show that one of the strategies, based on Random Walks, exhibits the smallest communication overhead.

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

U2 - 10.1109/DSN.2008.4630096

DO - 10.1109/DSN.2008.4630096

M3 - Paper

AN - SCOPUS:53349095728

SP - 277

EP - 286

T2 - 2008 International Conference on Dependable Systems and Networks, DSN-2008

Y2 - 24 June 2008 through 27 June 2008

ER -

Probabilistic quorum systems in wireless ad hoc networks

Abstract

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this