NobleBlocks

Research indexJournal article

A Timer Based Leader Election Algorithm

Biswas, Dutta

1 Jul 2016

NobleIDark:/48914/w1/20260525/A28B5EACDOI10.1109/uic-atc-scalcom-cbdcom-iop-smartworld.2016.0079

Paywalled

The full text is at the publisher

You can read the abstract here, or open it at the publisher.

Read at the publisher

Abstract

This paper addresses a problem of Leader Election in a distributed system. Basically Leader Election Algorithms choose a process or node among the number of processes or nodes as a Coordinator to manage the use of shared resources in an optimal manner, construct the fault-tolerant distributed systems. A good leader election algorithm should take less time, less message passing to elect a leader or Coordinator. In this paper, we introduce a timer based new leader election algorithm which is somehow or order beneficial than the existing leader election algorithms. The higher efficiency, better performance of our proposed algorithm with respect to the existing algorithms is validated through the complexity Analysis of the algorithms.

Discussion

Citations

Topics

More

Suggest a correction or report