Terminating Population Protocols via Some Minimal Global Knowledge Assumptions
- 598 Downloads
We extend the population protocol model with a cover-time service that informs a walking state every time it covers the whole network. This is simply a known upper bound on the cover time of a random walk. This allows us to introduce termination into population protocols, a capability that is crucial for any distributed system. By reduction to an oracle-model we arrive at a very satisfactory lower bound on the computational power of the model: we prove that it is at least as strong as a Turing Machine of space logn with input commutativity, where n is the number of nodes in the network. We also give a logn-space, but nondeterministic this time, upper bound. Finally, we prove interesting similarities of this model to linear bounded automata.
KeywordsTuring Machine Unique Leader Cover Time Input Symbol Counter Machine
Unable to display preview. Download preview PDF.
- [AAD+06]Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distributed Computing, 235–253 (2006)Google Scholar
- [Edi86]Edighoffer, J.L.: Distributed, replicated computer bulletin board service. PhD thesis, Stanford, CA, USA, UMI order no. GAX86-19742 (1986)Google Scholar
- [MCS11b]Michail, O., Chatzigiannakis, I., Spirakis, P.G.: New Models for Population Protocols. In: Lynch, N.A. (ed.) Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool (2011)Google Scholar
- [Vas08]Vaszil, G.: Multiset grammars, multiset automata, and membrane systems. In: Colloquium on the Occasion of the 50th Birthday of Victor Mitrana, pp. 1–10. Springer (2008)Google Scholar