Stabilizing leader election in partial synchronous systems with crash failures

Abstract

This article deals with stabilization and fault-tolerance. We consider two types of stabilization: the self-and the pseudo-stabilization. Our goal is to implement the self-and/or pseudo-stabilizing leader election in systems with process crashes, weak reliability, and synchrony assumptions. We try to propose, when it is possible, communication-efficient implementations. Our approach allows to obtain algorithms that tolerate both transient and crash failures.Note that some of our solutions are adapted from existing fault-tolerant algorithms. The motivation here is not to propose new algorithms but merely to show some assumptions required to obtain stabilizing leader elections in systems with crash failures. In particular, we focus on the borderline assumptions where we go from the possibility to have self-stabilizing solutions to the possibility to only have pseudo-stabilizing ones.

On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics

“…All results of this section are based on the notion of indistinguishable executions [13]. The principle of this proof scheme is as follows.…”

“…Due to the intrinsic absence of termination detection, stabilizing leader election is close to the eventual leader election problem Ω [13] studied in crash-prone partially synchronous, yet static and fully connected, systems. In this problem, all correct processes should eventually always designate the same correct process as leader [1].…”

A Distributed Fault Tolerance Global Coordinator Election Algorithm in Unreliable High Traffic Distributed Systems

“…This algorithm considered that network is anonymous and has restriction on response delay that is in contrast with ours which processes have IDs and delay is also accepted. Author in [9] studied stabilization and faulttolerant elections in systems with static crash failures.…”

Power Aware Reliable Virtual Machine Coordinator Election Algorithm in Service Oriented Systems

“…Coordinator will be the active node that initially created and sent message in the network. Stabilization and fau lt-tolerant elections in systems with static crash failures is studied by Delporte-Gallet [15]. They considered stabilization in the form of selfstabilization and pseudo-stabilization, so they tried to have election algorithms with these types of characteristics.…”

“…In the best case, Co mmunicat ion Cost (CC) of this algorith m is calculated by (15). However, it's Processing Time (PT) is equal to zero since all the alternatives are responding.…”