Population Protocols with Faulty Interactions: The Impact of a Leader

We consider the problem of simulating traditional population protocols under weaker models of communication, which include one-way interactions (as opposed to two-way interactions) and omission faults (i.e., failure by an agent to read its partner’s state during an interaction), which in turn may be detectable or undetectable. We focus on the impact of a leader, and we give a complete characterization of the models in which the presence of a unique leader in the system allows the construction of simulators: when simulations are possible, we give explicit protocols; when they are not, we give proofs of impossibility. Specifically, if each agent has only a finite amount of memory, the simulation is possible only if there are no omission faults. If agents have an unbounded amount of memory, the simulation is possible as long as omissions are detectable. If an upper bound on the number of omissions involving the leader is known, the simulation is always possible, except in the one-way model in which one side is unable to detect the interaction.

[1]  Nicola Santoro,et al.  Time-varying graphs and dynamic networks , 2010, Int. J. Parallel Emergent Distributed Syst..

[2]  David Eisenstat,et al.  Stably computable predicates are semilinear , 2006, PODC '06.

[3]  Eric Ruppert,et al.  Even Small Birds are Unique: Population Protocols with Identifiers , 2007 .

[4]  Paul G. Spirakis,et al.  Stably Decidable Graph Languages by Mediated Population Protocols , 2010, SSS.

[5]  Paul G. Spirakis,et al.  Mediated Population Protocols , 2009, ICALP.

[6]  Paul G. Spirakis,et al.  The Dynamics of Probabilistic Population Protocols , 2008, DISC.

[7]  Maria Gradinariu Potop-Butucaru,et al.  Self-stabilizing tiny interaction protocols , 2010, WRAS '10.

[8]  Rachid Guerraoui,et al.  Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures , 2009, ICALP.

[9]  Paul G. Spirakis,et al.  Passively mobile communicating machines that use restricted space , 2011, FOMC '11.

[10]  Paul G. Spirakis,et al.  Not All Fair Probabilistic Schedulers Are Equivalent , 2009, OPODIS.

[11]  Paul G. Spirakis,et al.  New Models for Population Protocols , 2011, Synthesis Lectures on Distributed Computing Theory.

[12]  Dan Alistarh,et al.  Polylogarithmic-Time Leader Election in Population Protocols , 2015, ICALP.

[13]  Ho-Lin Chen,et al.  Speed faults in computation by chemical reaction networks , 2014, Distributed Computing.

[14]  Dan Alistarh,et al.  Fast and Exact Majority in Population Protocols , 2015, PODC.

[15]  Paul G. Spirakis,et al.  All Symmetric Predicates in NSPACE(n2) Are Stably Computable by the Mediated Population Protocol Model , 2010, MFCS.

[16]  Johanne Cohen,et al.  On the Convergence of Population Protocols When Population Goes to Infinity , 2009, Appl. Math. Comput..

[17]  David Eisenstat,et al.  Fast computation by population protocols with a leader , 2006, Distributed Computing.

[18]  Nicola Santoro,et al.  Mediated Population Protocols: Leader Election and Applications , 2017, TAMC.

[19]  Joffroy Beauquier,et al.  Space-Optimal Counting in Population Protocols , 2015, DISC.

[20]  Michael J. Fischer,et al.  Computation in networks of passively mobile finite-state sensors , 2004, PODC '04.

[21]  Rachid Guerraoui,et al.  What dependability for networks of mobile sensor , 2005 .

[22]  David Eisenstat,et al.  On the Power of Anonymous One-Way Communication , 2005, OPODIS.

[23]  James Aspnes,et al.  An Introduction to Population Protocols , 2007, Bull. EATCS.

[24]  Michael J. Fischer,et al.  Self-stabilizing Leader Election in Networks of Finite-State Anonymous Agents , 2006, OPODIS.

[25]  Rachid Guerraoui,et al.  When Birds Die: Making Population Protocols Fault-Tolerant , 2006, DCOSS.

[26]  Koichi Wada,et al.  How to Prove Impossibility Under Global Fairness: On Space Complexity of Self-Stabilizing Leader Election on a Population Protocol Model , 2012, Theory of Computing Systems.

[27]  Shay Kutten,et al.  A self-stabilizing transformer for population protocols with covering , 2011, Theor. Comput. Sci..

[28]  Rachid Guerraoui,et al.  What Dependability for Networks of Mobile Sensors , 2005 .

[29]  David Eisenstat,et al.  A simple population protocol for fast robust approximate majority , 2007, Distributed Computing.

[30]  Nicola Santoro,et al.  On the Power of Weaker Pairwise Interaction: Fault-Tolerant Simulation of Population Protocols , 2017, 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS).