Novel leader election algorithm using buffer

To decide upon a leader or Coordinator in a distributed system is the most crucial task being carried out now a days. Many algorithms have been presented so far to elect a leader among many processes in the given network based upon the topologies. We here introduce an algorithm that includes the involvement of the buffer memory. The main idea behind this algorithm would be to elect a leader using binary search as well as insertion sort in the buffer queue. In this algorithm we try to achieve he best complexity of insertion sort using binary search that is O(nlogn). Thus, the proposed algorithm involves least message passing and less bandwidth utilization. The main issue of reducing the number of messages in a network is maintained in this algorithm and hence the time required to elect a coordinator is also reduced to a considerate level.