Academic Journals Database
Disseminating quality controlled scientific knowledge

Leader Election Algorithm in 3D Torus Networks with the Presence of One Link Failure

Author(s): Mohammed Refai | Ibrahim AL-Oqily | Abed Alhamori

Journal: World of Computer Science and Information Technology Journal
ISSN 2221-0741

Volume: 2;
Issue: 3;
Start page: 90;
Date: 2012;
VIEW PDF   PDF DOWNLOAD PDF   Download PDF Original page

Keywords: Concurrency | Leader Election | Link Failure | leader failure | 3D Torus Networks.

Leader election is the process of choosing a leader for symmetry breaking where each node in the network eventually decides whether it is a leader or not. This paper proposes a new leader election algorithm to solve the problem of leader failure in three dimensional torus networks. The proposed algorithm solves the election problem despite the existent of link failure. In a network of N nodes connected by three dimensional torus network, the new algorithm needs O(N) messages to elect a new leader in time steps. These results are valid for two cases: the simple case where the leader failure is detected by one node, and the worst case where the failure is discovered by N-1 nodes.
RPA Switzerland

RPA Switzerland

Robotic process automation


Tango Rapperswil
Tango Rapperswil