Electing a leader in the local computation model using mobile agents

Needless to say, distributed algorithms are usually hard to design mush harder to prove and to use in real distributed systems. In these systems, local computations theory has proved its power to formalize and prove in an intuitive way distributed algorithms. This paper uses this formalism to present solutions to the election problem in several network topologies using mobile agents at the design and the implementation levels. We formalized the proposed solutions in the local computations model using transition systems [11]. This facilitates the proof of the proposed solutions using the mathematical tool-box provided by the local computation theory. Using mobile agents, the proposed solutions get rid of synchronization and do not need continuous use of all machines computational resources. Proposed solutions are also simulated within the VISIDIA [3] platform.

[1]  Imdea Networks.  Eventual Leader Election with Weak Assumptions on Initial Knowledge,Communication Reliability,and Synchrony , 2010 .

[2]  Anca Muscholl,et al.  The Power of Local Computations in Graphs with Initial Knowledge , 1998, TAGT.

[3]  Alexander E. Kostin,et al.  Simulation of a novel leader election protocol with the use of Petri nets , 2005, Ninth IEEE International Symposium on Distributed Simulation and Real-Time Applications.

[4]  Hans Svensson,et al.  A new leader election implementation , 2005, ERLANG '05.

[5]  Grzegorz Rozenberg,et al.  Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations , 1997 .

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

[7]  Yves Métivier,et al.  Mobile Agent Algorithms Versus Message Passing Algorithms , 2006, OPODIS.

[8]  Erik Vee,et al.  Scalable leader election , 2006, SODA '06.

[9]  Mohamed Jmaiel,et al.  Proving Distributed Algorithms for Mobile Agents: Examples of Spanning Tree Computation in Anonymous Networks , 2015, ICDCN.

[10]  Yves Métivier,et al.  Election, Naming and Cellular Edge Local Computations , 2004, ICGT.

[11]  Gurdip Singh,et al.  Leader Election in Complete Networks , 1997, SIAM J. Comput..

[12]  Nicola Santoro,et al.  Design and analysis of distributed algorithms , 2006, Wiley series on parallel and distributed computing.

[13]  Wei Shi,et al.  Leader election in oriented star graphs , 2005, Networks.

[14]  Yehuda Afek,et al.  Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks , 1991, SIAM J. Comput..

[15]  Bilel Derbel,et al.  Distributed Graph Traversals by Relabelling Systems with Applications , 2006, GT-VC@CONCUR.

[16]  Michel Billaud,et al.  Graph Rewriting Systems with Priorities , 1989, WG.

[17]  Yves Métivier,et al.  Computing with Graph Rewriting Systems with Priorities , 1993, Theor. Comput. Sci..

[18]  Nicola Santoro.  Design and Analysis of Distributed Algorithms (Wiley Series on Parallel and Distributed Computing) , 2006 .

[19]  Masafumi Yamashita,et al.  Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct , 1999, IEEE Trans. Parallel Distributed Syst..

[20]  Yves Métivier,et al.  Visualization of Distributed Algorithms Based on Graph Relabelling Systems , 2001, GT-VMT@ICALP.

[21]  Yves Métivier,et al.  Synchronizers for Local Computations , 2004, ICGT.