Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4952178 | Theoretical Computer Science | 2017 | 20 Pages |
Abstract
The Population Protocol model is a distributed model that concerns systems of very weak computational entities that cannot control the way they interact. The model of Network Constructors is a variant of Population Protocols capable of (algorithmically) constructing abstract networks. Both models are characterized by a fundamental inability to terminate. In this work, we investigate the minimal strengthenings of the latter model that could overcome this inability. Our main conclusion is that initial connectivity of the communication topology combined with the ability of the protocol to transform the communication topology and the ability of a node to detect when its degree is equal to a small constant, plus either a unique leader or the ability of detecting common neighbors, are sufficient to guarantee not only termination but also the maximum computational power that one can hope for in this family of models. The technique of our protocols is to transform any initial connected topology to a less symmetric (that can serve as a large ordered memory) and detectable (that the protocol can determine its successful construction) topology without ever breaking its connectivity during the transformation. The target topology of all of our transformers is the spanning line and we call Terminating Line Transformation the corresponding problem. We first study the case in which there is a pre-elected unique leader and give a time-optimal protocol for Terminating Line Transformation. We then prove that dropping the leader without additional assumptions leads to a strong impossibility result. In an attempt to overcome this, we equip the nodes with the ability to tell, during their pairwise interactions, whether they have at least one neighbor in common. Interestingly, it turns out that this local and realistic mechanism is sufficient to make the problem solvable. In particular, we give a very efficient protocol that solves Terminating Line Transformation when all nodes are initially identical. The latter implies the aforementioned strong characterization: the model, under a few minimal assumptions, computes with termination any symmetric predicate computable by a Turing Machine of space Î(n2).
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Othon Michail, Paul G. Spirakis,