Modified Election algorithm in Distributed System using election commission & comparision with original bully algorithm & ring algorithm

Abstract

In this paper an election algorithm is presented that can be used in distributed systems to elect a coordinator. Many distributed algorithms need one process to act as a leader or coordinator to make synchronization between different processes. There are various algorithms that elect a particular node as coordinator from all the different nodes in the distributed network. This paper will present a modified version of bully election algorithm using a new concept called election commission. This approach will not only reduce the number of messages per election but also minimize total number of elections and hence it will minimize network traffic, redundant elections.

Keywords: Coordinator; Election Commission; Distributed system; Bully election; Ring election; Messages; Complexity.