Apr 22, 2021 · This Lea-TN is a deterministic and robust algorithm that elects a leader for a synchronous distributed system.

Nov 1, 2021 · In this paper, we propose a lower bound Ω ( N log 3 N ) of message complexity on a comparison-based leader election for a 2D torus network ( ...

The Lea-. TN algorithm is designed considering both the node and link failures of the torus networks. It is a deterministic algorithm that can elect a leader ...

Apr 24, 2021 · Next, we sketch a new leader election algorithm (Lea-TN) considering both the node and link failures for a 2D torus network. This Lea-TN is ...

Next, we sketch a new leader election algorithm (Lea-TN) considering both the node and link failures for a 2D torus network. This Lea-TN is a deterministic ...

This Lea-TN is a deterministic and robust algorithm that elects a leader for a synchronous distributed system. The algorithm chooses a leader, even when there ...

In this paper, we propose a lower bound Ω ( N log 3 ⁡ N ) of message complexity on a comparison-based leader election for a 2D torus network (where N is the ...

Amit Biswas , Anil Kumar Tripathi, Samir Aknine: Lea-TN: leader election algorithm considering node and link failures in a torus network. J. Supercomput.

Sep 4, 2024 · Lea-TN: Leader Election Algorithm Considering Node and Link Failures in a Torus Network. Amit Biswas , Anil Kumar Tripathi , Samir Aknine (1).

A new leader election algorithm in two dimensional torus networks that uses O(N) messages to elect a new leader in O( N ) time steps and results are valid ...