What can be decided locally without identifiers?

Do unique node identifiers help in deciding whether a network G has a prescribed property P? We study this question in the context of distributed local decision, where the objective is to decide whether G has property P by having each node run a constant-time distributed decision algorithm. In a yes-instance all nodes should output yes, while in a no-instance at least one node should output no. Recently, Fraigniaud et al. (OPODIS 2012) gave several conditions under which identifiers are not needed, and they conjectured that identifiers are not needed in any decision problem. In the present work, we disprove the conjecture. More than that, we analyse two critical variations of the underlying model of distributed computing: (B): the size of the identifiers is bounded by a function of the size of the input network, (¬B): the identifiers are unbounded, (C): the nodes run a computable algorithm, (¬C): the nodes can compute any, possibly uncomputable function. While it is easy to see that under (¬B, ¬C) identifiers are not needed, we show that under all other combinations there are properties that can be decided locally if and only if identifiers are present.

[1]  Toshimitsu Masuzawa,et al.  Fast and compact self-stabilizing verification, computation, and fault detection of an MST , 2011, PODC '11.

[2]  Pierre Fraigniaud,et al.  Locality and Checkability in Wait-Free Computing , 2011, DISC.

[3]  David Peleg,et al.  Tight Bounds For Distributed MST Verification , 2011, STACS.

[4]  Jukka Suomela,et al.  Lower bounds for local approximation , 2012, PODC '12.

[5]  Pierre Fraigniaud,et al.  Local Distributed Decision , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[6]  Jean-Sébastien Sereni,et al.  Toward more localized local algorithms: removing assumptions concerning global knowledge , 2011, PODC '11.

[7]  Andrzej Pelc,et al.  Decidability Classes for Mobile Agents Computing , 2012, LATIN.

[8]  Pierre Fraigniaud,et al.  Randomized distributed decision , 2012, Distributed Computing.

[9]  Mika Göös,et al.  Locally checkable proofs , 2011, PODC '11.

[10]  Moni Naor,et al.  What Can be Computed Locally? , 1995, SIAM J. Comput..

[11]  Shay Kutten,et al.  Proof labeling schemes , 2005, PODC '05.

[12]  David Peleg,et al.  Distributed Computing: A Locality-Sensitive Approach , 1987 .

[13]  Pierre Fraigniaud,et al.  On the Impact of Identifiers on Local Decision , 2012, OPODIS.

[14]  Moni Naor,et al.  Local computations on static and dynamic graphs , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

[15]  Nathan Linial,et al.  Locality in Distributed Graph Algorithms , 1992, SIAM J. Comput..

[16]  Shay Kutten,et al.  Distributed verification of minimum spanning trees , 2006, PODC '06.

[17]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.