Distributed probabilistic polling and applications to proportionate agreement

Yehuda Hassin, David Peleg

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publicationAutomata, Languages and Programming - 26th International Colloquium, ICALP 1999, Proceedings
PublisherSpringer Verlag
Pages402-411
Number of pages10
ISBN (Print)3540662243, 9783540662242
DOIs
StatePublished - 1999
Externally publishedYes
Event26th International Colloquium on Automata, Languages and Programming, ICALP 1999 - Prague, Czech Republic
Duration: 11 Jul 199915 Jul 1999

Publication series

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

Conference

Conference26th International Colloquium on Automata, Languages and Programming, ICALP 1999
Country/TerritoryCzech Republic
CityPrague
Period11/07/9915/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

Fingerprint

Dive into the research topics of 'Distributed probabilistic polling and applications to proportionate agreement'. Together they form a unique fingerprint.

Cite this