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 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.
| Original language | English |
|---|---|
| Pages (from-to) | 248-268 |
| Number of pages | 21 |
| Journal | Information and Computation |
| Volume | 171 |
| Issue number | 2 |
| DOIs | |
| State | Published - 15 Dec 2001 |
| Externally published | Yes |
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 |