Distributed Probabilistic Polling and Applications to Proportionate Agreement

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

[1]  Eric Goles Ch.,et al.  Periodic behaviour of generalized threshold functions , 1980, Discret. Math..

[2]  James A. McHugh,et al.  Algorithmic Graph Theory , 1986 .

[3]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[4]  Hagit Attiya,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .

[5]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[6]  Yehuda Afek,et al.  Local stabilizer , 1997, PODC '97.

[7]  Michael E. Saks,et al.  Sphere packing and local majorities in graphs , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[8]  Masafumi Yamashita,et al.  Probabilistic Local Majority Voting for the Agreement Problem on Finite Graphs , 1999, COCOON.

[9]  Baruch Awerbuch,et al.  Applying static network protocols to dynamic networks , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[10]  Arthur L. Liestman,et al.  A survey of gossiping and broadcasting in communication networks , 1988, Networks.

[11]  J. French,et al.  A formal theory of social power. , 1956, Psychological review.

[12]  Stéphane Pérennes,et al.  Tight Bounds on the Size of 2-Monopolies , 1996, SIROCCO.

[13]  David J. Aldous,et al.  Lower bounds for covering times for reversible Markov chains and random walks on graphs , 1989 .

[14]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[15]  David Peleg,et al.  Distributed Probabilistic Polling and Applications to Proportionate Agreement , 1999, ICALP.

[16]  Eric Goles Ch.,et al.  Decreasing energy functions as a tool for studying threshold networks , 1985, Discret. Appl. Math..

[17]  Torben Hagerup,et al.  A Guided Tour of Chernoff Bounds , 1990, Inf. Process. Lett..

[18]  David Peleg,et al.  Extremal bounds for probabilistic polling in graphs , 2000, SIROCCO.

[19]  David Peleg,et al.  Size Bounds for Dynamic Monopolies , 1998, Discret. Appl. Math..

[20]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[21]  Svatopluk Poljak,et al.  On periodical behaviour in societies with symmetric influences , 1983, Comb..

[22]  D. Peleg.  Local Majority Voting, Small Coalitions and Controlling Monopolies in Graphs: A Review , 1996 .

[23]  M. Degroot.  Reaching a Consensus , 1974 .

[24]  R. Holley,et al.  Ergodic Theorems for Weakly Interacting Infinite Systems and the Voter Model , 1975 .

[25]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[26]  P. Donnelly,et al.  Finite particle systems and infection models , 1983, Mathematical Proceedings of the Cambridge Philosophical Society.