Distributed Graph Traversals by Relabelling Systems with Applications

Abstract

Graph traversals are in the basis of many distributed algorithms. In this paper, we use graph relabelling systems to encode two basic graph traversals which are the broadcast and the convergecast. This encoding allows us to derive formal, modular and simple encoding for many distributed graph algorithms. We illustrate this method by investigating the distributed computation of a breadthfirst spanning tree and the distributed computation of a minimum spanning tree. Our formalism allows to focus on the correctness of a distributed algorithm rather than on the implementation and the communication details.

Electing a leader in the local computation model using mobile agents

“…This problem has been investigated many researches while considering different models of the distributed system and different parameters related to the network topology and the initial knowledge [17,20,12,21]. The algorithms proposed to solve this problem are generally based on message passing systems [8,6,7,10]. Nevertheless, with the success of mobile agent based applications, regards are switched from old systems (message passing, shared memory, remote procedure call, etc) toward this new paradigm.…”