Comparison of Various Election Algorithms in Distributed System
Priyanka Gupta, Rajeev G. Vishwakarma · International Journal of Computer Applications · 2012
This paper present the comparison between the various available algorithms on the basis of their structure, assumptions and the main thing is complexity.We compare the algorithms with our proposed one.We take the message complexity of various algorithms from previous papers.And calculate the message complexity for our newly define approach, and compare the calculated complexity with all the available algorithms complexity.The result shows that our proposed approach is more efficient than the previous approaches also it has less no of message passing during communication.