Algorithmic graph theory
A guided tour of Chernoff bounds
Information Processing Letters
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
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
Probabilistic local majority voting for the agreement problem on finite graphs
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
On the expected time for Herman's probabilistic self-stabilizing algorithm
Theoretical Computer Science
Near-optimal solutions for the generalized max-controlled set problem
Computers and Operations Research
Distributed anonymous function computation in information fusion and multiagent systems
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Convergence speed of binary interval consensus
INFOCOM'10 Proceedings of the 29th conference on Information communications
Brief announcement: on reversible and irreversible conversions
DISC'10 Proceedings of the 24th international conference on Distributed computing
Irreversible conversion of graphs
Theoretical Computer Science
Random walks, interacting particles, dynamic networks: randomness can be helpful
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Coalescing random walks and voting on graphs
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Reversible iterative graph processes
Theoretical Computer Science
| Hi-index | 0.00 |
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 lightweight, 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. The paper also investigates the maximum influence of small sets and establishes results analogous to those obtained for the problem in the deterministic polling model. 2001 Elsevier Science