Maximize Leader Election Algorithm Performance in Bi-Directional Ring Networks With Both Links Down Between Two Nodes

The process of selecting a leader to avoid instability in distributed system network after leader failure is called Leader Election Algorithm (LEA). This process becomes more complicated when it faces intermittent or complete links disconnected. the network becomes a one-way behavior if both lines of communication between two points are disrupted and thus the network becomes very slow, especially in systems where time is a critical issue, and the process of communication between points becomes much slower if the network leader is next to the fault or close to it, so the criteria will be established to ensures that the system leader in the Bidirectional ring communication network is in a place that allows next leader to communicate with all points as quickly as possible, and this will be during the election operation.This research presents a solution for leader failure problem in bidirectional ring network. This research takes into account the existence of intermittent or disconnection links between nodes. It will produce three algorithms to determine a new leader in the network with maximum network performance. It uses the least probability of time steps and the number of messages needed to elect the new leader in bidirectional ring network with N communicated nodes. so that the system remains able to work and communicate with its best capacity during this problem with the number of message complexity O(N) in the worst case. The third scenario minimizes the value of proper leader ID $\frac{{I{D_{Current}}}}{{{I_{Current}}idStepCount}}$, and maximizes the value of proper leader place N − (N − nStepCount).