Topology recognition and leader election in colored networks

Topology recognition and leader election are fundamental tasks in distributed computing in networks. The first of them requires each node to find a labeled isomorphic copy of the network, while the result of the second one consists in a single node adopting the label 1 (leader), with all other nodes adopting the label 0 and learning a path to the leader. We consider both these problems in networks whose nodes are equipped with not necessarily distinct labels called colors, and ports at each node of degree d are arbitrarily numbered 0 , 1 , ? , d - 1 . Colored networks are generalizations both of labeled networks, in which nodes have distinct labels, and of anonymous networks, in which nodes do not have labels (all nodes have the same color).In colored networks, topology recognition and leader election are not always feasible. Hence we study two more general problems. Consider a colored network and an input I given to its nodes. The aim of the problem TOP, for this colored network and for I, is to solve topology recognition in this network, if this is possible under input I, and to have all nodes answer "unsolvable" otherwise. Likewise, the aim of the problem LE is to solve leader election in this network, if this is possible under input I, and to have all nodes answer "unsolvable" otherwise.We show that nodes of a network can solve problems TOP and LE, if they are given, as input I, an upper bound k on the number of nodes of a given color, called the size of this color. On the other hand we show that, if the nodes are given an input that does not bound the size of any color, then the answer to TOP and LE must be "unsolvable", even for the class of rings.Under the assumption that nodes are given an upper bound k on the size of a given color, we study the time of solving problems TOP and LE in the LOCAL model in which, during each round, each node can exchange arbitrary messages with all its neighbors and perform arbitrary local computations. We give an algorithm to solve each of these problems in arbitrary networks in time O ( k D + D log ? ( n / D ) ) , where D is the diameter of the network and n is its size. We also show that this time is optimal, by exhibiting classes of networks in which every algorithm solving problems TOP or LE must use time ? ( k D + D log ? ( n / D ) ) .

[1]  Naoshi Sakamoto,et al.  Comparison of initial conditions for distributed algorithms on anonymous networks , 1999, PODC '99.

[2]  Andrzej Pelc,et al.  How much memory is needed for leader election , 2011, Distributed Computing.

[3]  Andrzej Pelc,et al.  Leader election in ad hoc radio networks: A keen ear helps , 2013, J. Comput. Syst. Sci..

[4]  Jérémie Chalopin.  Local Computations on Closed Unlabelled Edges: The Election Problem and the Naming Problem , 2005, SOFSEM.

[5]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[6]  Yves Métivier,et al.  Election and Local Computations on Edges , 2004, FoSSaCS.

[7]  Andrzej Pelc,et al.  Leader Election in Rings with Nonunique Labels , 2004, Fundam. Informaticae.

[8]  Andrzej Pelc,et al.  Use Knowledge to Learn Faster: Topology Recognition with Advice , 2013, DISC.

[9]  Masafumi Yamashita,et al.  Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases , 1996, IEEE Trans. Parallel Distributed Syst..

[10]  Andrzej Pelc,et al.  Leader election for anonymous asynchronous agents in arbitrary networks , 2012, Distributed Computing.

[11]  Krzysztof Diks,et al.  Anonymous Wireless Rings , 1995, Theor. Comput. Sci..

[12]  Andrzej Pelc,et al.  Election vs. Selection: Two Ways of Finding the Largest Node in a Graph , 2014, ArXiv.

[13]  Andrzej Pelc,et al.  Time vs. Information Tradeoffs for Leader Election in Anonymous Trees , 2015, SODA.

[14]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[15]  Sebastiano Vigna,et al.  Computing anonymously with arbitrary knowledge , 1999, PODC '99.

[16]  Hagit Attiya,et al.  Renaming in an asynchronous environment , 1990, JACM.

[17]  Baruch Awerbuch,et al.  A trade-off between information and communication in broadcast protocols , 1990, JACM.

[18]  Samir Guglani.  Knowledge , 2016, The Lancet.

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

[20]  Andrzej Pelc,et al.  Knowledge, level of symmetry, and time of leader election , 2014, Distributed Computing.

[21]  Stephan Olariu,et al.  Uniform leader election protocols for radio networks , 2001, International Conference on Parallel Processing, 2001..

[22]  Adrian Kosowski,et al.  Distinguishing views in symmetric networks: A tight lower bound , 2015, Theor. Comput. Sci..

[23]  Miroslaw Kutylowski,et al.  Efficient algorithms for leader election in radio networks , 2002, PODC '02.

[24]  Masafumi Yamashita,et al.  Computing on an anonymous network , 1988, PODC '88.

[25]  Masafumi Yamashita,et al.  Electing a Leader when Processor Identity Numbers are not Distinct (Extended Abstract) , 1989, WDAG.

[26]  Dana Angluin,et al.  Local and global properties in networks of processors (Extended Abstract) , 1980, STOC '80.

[27]  Nancy A. Lynch,et al.  Electing a leader in a synchronous ring , 1987, JACM.

[28]  Nancy Norris,et al.  Universal Covers of Graphs: Isomorphism to Depth N-1 Implies Isomorphism to All Depths , 1995, Discret. Appl. Math..

[29]  Gérard Le Lann,et al.  Distributed Systems - Towards a Formal Approach , 1977, IFIP Congress.

[30]  Gary L. Peterson,et al.  An O(nlog n) Unidirectional Algorithm for the Circular Extrema Problem , 1982, TOPL.

[31]  Evangelos Kranakis,et al.  Computing Boolean Functions on Anonymous Networks , 1990, ICALP.

[32]  Mohamed Jmaiel,et al.  Electing a leader in the local computation model using mobile agents , 2008, 2008 IEEE/ACS International Conference on Computer Systems and Applications.

[33]  Daniel S. Hirschberg,et al.  Decentralized extrema-finding in circular configurations of processors , 1980, CACM.

[34]  Paola Flocchini,et al.  Sorting and election in anonymous asynchronous rings , 2004, J. Parallel Distributed Comput..

[35]  Adrian Kosowski,et al.  Constructing a Map of an Anonymous Graph: Applications of Universal Sequences , 2010, OPODIS.

[36]  Evangelos Kranakis,et al.  Computing Boolean Functions on Anonymous Networks , 1994, Inf. Comput..

[37]  E. Kranakis.  Symmetry and computability in anonymous networks: a brief survey , 1996 .

[38]  Hagit Attiya,et al.  Better Computing on the Anonymous Ring , 1988, J. Algorithms.

[39]  Andrzej Pelc,et al.  Drawing maps with advice , 2010, J. Parallel Distributed Comput..

[40]  Dan E. Willard,et al.  Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel , 1986, SIAM J. Comput..

[41]  Julien M. Hendrickx.  Views in a Graph: To Which Depth Must Equality Be Checked? , 2014, IEEE Transactions on Parallel and Distributed Systems.

[42]  Sebastiano Vigna,et al.  Symmetry Breaking in Anonymous Networks: Characterizations , 1996, ISTCS.

[43]  Baruch Awerbuch,et al.  Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems , 1987, STOC.

[44]  Yves Métivier,et al.  Labelled (Hyper)Graphs, Negotiations and the Naming Problem , 2008, ICGT.