Distributed probabilistic polling and applications to proportionate agreement

Yehuda Hassin; David Peleg

doi:10.1007/3-540-48523-6_37

Distributed probabilistic polling and applications to proportionate agreement

Yehuda Hassin, David Peleg

Weizmann Institute of Science

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

15 Scopus citations

Abstract

This paper considers a probabilistic local polling process, examines its properties and proposes its use in the context of distribu- Ted network protocols for achieving consensus. The resulting consensus algorithm is very simple and light-weight, yet it enjoys some desirable properties, such as proportionate agreement (namely, reaching a consen- sus value of one with probability proportional to the number of ones in the inputs), resilience against dynamic link failures and recoveries, and (weak) self-stabilization.

Original language	English
Title of host publication	Automata, Languages and Programming - 26th International Colloquium, ICALP 1999, Proceedings
Publisher	Springer Verlag
Pages	402-411
Number of pages	10
ISBN (Print)	3540662243, 9783540662242
DOIs	https://doi.org/10.1007/3-540-48523-6_37
State	Published - 1999
Externally published	Yes
Event	26th International Colloquium on Automata, Languages and Programming, ICALP 1999 - Prague, Czech Republic Duration: 11 Jul 1999 → 15 Jul 1999

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1644 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	26th International Colloquium on Automata, Languages and Programming, ICALP 1999
Country/Territory	Czech Republic
City	Prague
Period	11/07/99 → 15/07/99

Bibliographical note

Funding Information:
1 The results of this paper are based on Hassin’s M.Sc. thesis [H98] and were reported in preliminary version in [HP99, HP00]. 2Supported in part by a grant from the Israel Science Foundation and by a grant from the Israel Ministry of Science and Art. 248

Funding

1 The results of this paper are based on Hassin’s M.Sc. thesis [H98] and were reported in preliminary version in [HP99, HP00]. 2Supported in part by a grant from the Israel Science Foundation and by a grant from the Israel Ministry of Science and Art. 248

Funders	Funder number
Israel Ministry of Science and Art. 248
Israel Science Foundation

Access to Document

10.1007/3-540-48523-6_37

Cite this

Hassin, Y., & Peleg, D. (1999). Distributed probabilistic polling and applications to proportionate agreement. In Automata, Languages and Programming - 26th International Colloquium, ICALP 1999, Proceedings (pp. 402-411). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1644 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-48523-6_37

Hassin, Yehuda ; Peleg, David. / Distributed probabilistic polling and applications to proportionate agreement. Automata, Languages and Programming - 26th International Colloquium, ICALP 1999, Proceedings. Springer Verlag, 1999. pp. 402-411 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{33d3e6cb17244b608ef672e011901fff,

title = "Distributed probabilistic polling and applications to proportionate agreement",

abstract = "This paper considers a probabilistic local polling process, examines its properties and proposes its use in the context of distribu- Ted network protocols for achieving consensus. The resulting consensus algorithm is very simple and light-weight, yet it enjoys some desirable properties, such as proportionate agreement (namely, reaching a consen- sus value of one with probability proportional to the number of ones in the inputs), resilience against dynamic link failures and recoveries, and (weak) self-stabilization.",

author = "Yehuda Hassin and David Peleg",

note = "Funding Information: 1 The results of this paper are based on Hassin{\textquoteright}s M.Sc. thesis [H98] and were reported in preliminary version in [HP99, HP00]. 2Supported in part by a grant from the Israel Science Foundation and by a grant from the Israel Ministry of Science and Art. 248; 26th International Colloquium on Automata, Languages and Programming, ICALP 1999 ; Conference date: 11-07-1999 Through 15-07-1999",

year = "1999",

doi = "10.1007/3-540-48523-6_37",

language = "אנגלית",

isbn = "3540662243",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "402--411",

booktitle = "Automata, Languages and Programming - 26th International Colloquium, ICALP 1999, Proceedings",

address = "גרמניה",

}

Hassin, Y & Peleg, D 1999, Distributed probabilistic polling and applications to proportionate agreement. in Automata, Languages and Programming - 26th International Colloquium, ICALP 1999, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1644 LNCS, Springer Verlag, pp. 402-411, 26th International Colloquium on Automata, Languages and Programming, ICALP 1999, Prague, Czech Republic, 11/07/99. https://doi.org/10.1007/3-540-48523-6_37

Distributed probabilistic polling and applications to proportionate agreement. / Hassin, Yehuda; Peleg, David.
Automata, Languages and Programming - 26th International Colloquium, ICALP 1999, Proceedings. Springer Verlag, 1999. p. 402-411 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1644 LNCS).

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

TY - GEN

T1 - Distributed probabilistic polling and applications to proportionate agreement

AU - Hassin, Yehuda

AU - Peleg, David

N1 - Funding Information: 1 The results of this paper are based on Hassin’s M.Sc. thesis [H98] and were reported in preliminary version in [HP99, HP00]. 2Supported in part by a grant from the Israel Science Foundation and by a grant from the Israel Ministry of Science and Art. 248

PY - 1999

Y1 - 1999

N2 - This paper considers a probabilistic local polling process, examines its properties and proposes its use in the context of distribu- Ted network protocols for achieving consensus. The resulting consensus algorithm is very simple and light-weight, yet it enjoys some desirable properties, such as proportionate agreement (namely, reaching a consen- sus value of one with probability proportional to the number of ones in the inputs), resilience against dynamic link failures and recoveries, and (weak) self-stabilization.

AB - This paper considers a probabilistic local polling process, examines its properties and proposes its use in the context of distribu- Ted network protocols for achieving consensus. The resulting consensus algorithm is very simple and light-weight, yet it enjoys some desirable properties, such as proportionate agreement (namely, reaching a consen- sus value of one with probability proportional to the number of ones in the inputs), resilience against dynamic link failures and recoveries, and (weak) self-stabilization.

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

U2 - 10.1007/3-540-48523-6_37

DO - 10.1007/3-540-48523-6_37

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:35048841350

SN - 3540662243

SN - 9783540662242

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 402

EP - 411

BT - Automata, Languages and Programming - 26th International Colloquium, ICALP 1999, Proceedings

PB - Springer Verlag

T2 - 26th International Colloquium on Automata, Languages and Programming, ICALP 1999

Y2 - 11 July 1999 through 15 July 1999

ER -

Hassin Y, Peleg D. Distributed probabilistic polling and applications to proportionate agreement. In Automata, Languages and Programming - 26th International Colloquium, ICALP 1999, Proceedings. Springer Verlag. 1999. p. 402-411. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-48523-6_37

Distributed probabilistic polling and applications to proportionate agreement

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this