Distributed Probabilistic Polling and Applications to Proportionate Agreement

Authors:
Yehuda Hassin;David Peleg
Affiliations:
-;-
Venue:
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Year:
1999

Citing 6
Cited 1

Randomized algorithms

Randomized algorithms
The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed computing: fundamentals, simulations and advanced topics

Distributed computing: fundamentals, simulations and advanced topics
Distributed Algorithms

Distributed Algorithms
Local Stabilizer

ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
Applying static network protocols to dynamic networks

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science

Majority Consensus and the Local Majority Rule

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers a probabilistic local polling process, examines its properties and proposes its use in the context of distributed 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 consensus 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.