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: Chapter in Book/Report/Conference proceeding › Conference contribution › 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
Title of host publication	2008 International Conference on Dependable Systems and Networks, DSN-2008
Publisher	Institute of Electrical and Electronics Engineers
Pages	277-286
Number of pages	10
ISBN (Print)	9781424423972
DOIs	https://doi.org/10.1109/DSN.2008.4630096
State	Published - 1 Jan 2008
Event	2008 International Conference on Dependable Systems and Networks, DSN-2008 - Anchorage, AK, United States Duration: 24 Jun 2008 → 27 Jun 2008

Publication series

Name	Proceedings of the International Conference on Dependable Systems and Networks

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

Friedman, R., Kliot, G., & Avin, C. (2008). Probabilistic quorum systems in wireless ad hoc networks. In 2008 International Conference on Dependable Systems and Networks, DSN-2008 (pp. 277-286). Article 4630096 (Proceedings of the International Conference on Dependable Systems and Networks). Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/DSN.2008.4630096

@inproceedings{0607bf28559e41d5898274f09dff85bb,

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 = jan,

day = "1",

doi = "10.1109/DSN.2008.4630096",

language = "English",

isbn = "9781424423972",

series = "Proceedings of the International Conference on Dependable Systems and Networks",

publisher = "Institute of Electrical and Electronics Engineers",

pages = "277--286",

booktitle = "2008 International Conference on Dependable Systems and Networks, DSN-2008",

address = "United States",

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

}

Friedman, R, Kliot, G & Avin, C 2008, Probabilistic quorum systems in wireless ad hoc networks. in 2008 International Conference on Dependable Systems and Networks, DSN-2008., 4630096, Proceedings of the International Conference on Dependable Systems and Networks, Institute of Electrical and Electronics Engineers, pp. 277-286, 2008 International Conference on Dependable Systems and Networks, DSN-2008, Anchorage, AK, United States, 24/06/08. https://doi.org/10.1109/DSN.2008.4630096

Probabilistic quorum systems in wireless ad hoc networks. / Friedman, Roy; Kliot, Gabriel; Avin, Chen.
2008 International Conference on Dependable Systems and Networks, DSN-2008. Institute of Electrical and Electronics Engineers, 2008. p. 277-286 4630096 (Proceedings of the International Conference on Dependable Systems and Networks).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Probabilistic quorum systems in wireless ad hoc networks

AU - Friedman, Roy

AU - Kliot, Gabriel

AU - Avin, Chen

PY - 2008/1/1

Y1 - 2008/1/1

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 - https://www.scopus.com/pages/publications/53349095728

U2 - 10.1109/DSN.2008.4630096

DO - 10.1109/DSN.2008.4630096

M3 - Conference contribution

AN - SCOPUS:53349095728

SN - 9781424423972

T3 - Proceedings of the International Conference on Dependable Systems and Networks

SP - 277

EP - 286

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

PB - Institute of Electrical and Electronics Engineers

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

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this