Leader Election Algorithms in Distributed Systems
نویسندگان
چکیده
A Distributed system is an application which executes a collection of protocols to coordinate the actions of multiple processes on a network, such that all components cooperate together in order to perform a single or small set of related tasks. It is very difficult for processes to cooperate with each other because of failures of any of the process during communication. The leader election is critical problem in distributed system as data is distributed among different node which is geographically separated. To maintain co-ordination between the node, leader node have to be selected. This paper contains the information about the various existing leader election mechanisms which is used for selecting the leader in different problems.
منابع مشابه
Leader Election Algorithms in Torus and Hypercube Networks Comparisons and Survey
Leader failure is one of the most fundamental problems in distributed systems. This problem can be solved by Leader Election Algorithms (LEAs). These algorithms move the system from an initial state where all the nodes are in the same computation state into a new state where only one node is distinguished computationally (called leader) and all other nodes aware of this leader. This research ai...
متن کاملDesigning and Evaluating Fault-tolerant Leader Election Algorithms
Fault-tolerant leader election is a basic building block for dependable distributed computing, since it allows coordinating decisions among replicas such that they remain consistent. Indeed, several fault-tolerant agreement protocols rely on an eventual leader election service. This problem has been initially studied in crash-prone systems, and more recently in other failure scenarios, e.g., cr...
متن کاملSelf-stabilizing Leader Election in Networks of Finite-State Anonymous Agents
This paper considers the self-stabilizing leader-election problem in a model of interacting anonymous finite-state agents. Leader election is a fundamental problem in distributed systems; many distributed problems are easily solved with the help of a central coordinator. Selfstabilizing algorithms do not require initialization in order to operate correctly and can recover from transient faults ...
متن کاملPALE: Partially Asynchronous Agile Leader Election
Many tasks executed in dynamic distributed systems, such as sensor networks or enterprise environments with bring-your-owndevice policy, require central coordination by a leader node. In the past it has been proven that distributed leader election in dynamic environments with constant changes and asynchronous communication is not possible. Thus, state-of-the-art leader election algorithms are n...
متن کاملLeader election in synchronous networks
Worst, best and average number of messages and running time of leader election algorithms of different distributed systems are analyzed. Among others the known characterizations of the expected number of messages for LCR algorithm and of the worst number of messages of Hirschberg-Sinclair algorithm are improved.
متن کامل