%0 Journal Article %1 noauthororeditor %A BeaulahSoundarabai, P %A Venugopal, Thriveni J K R %A Patnaik, L M %D 2013 %J International Journal of Next-Generation Networks (IJNGN) %K Algorithm Complexity Coordinator Distributed Election Message Ring System %N 1 %P 21 - 29 %T AN IMPROVED LEADER ELECTION ALGORITHM FOR DISTRIBUTED SYSTEMS %U http://airccse.org/journal/ijngn/current2013.html %V 5 %X Leader Election Algorithm , not only in distributed systems but in any communication network, is an essential matter for discussion. Tremendous amount of work are happening in the research community on this Election, because many network protocols are in need of a coordinator process for the smooth running of the system. These socalled Leader or Coordinator processes are responsible for the synchronization of the system. If there is no synchronization, then the entire system would become inconsistent which intern makes the system to lose its reliability. Since all the processes need to interact with the leader process, they all must agree upon who the present leader is. Furthermore, if the leader process crashes, the new leader process should take the charge as early as possible. New leader is one among the currently running processes with the highest process id. In this paper we have presented a modified version of ring algorithm. Our work involves substantial modifications of the existing ring election algorithm and the comparison of message complexity with the original algorithm. Simulation results show that our algorithmminimizes the number of messages being exchanged in electing the coordinator..

@article{noauthororeditor, abstract = {Leader Election Algorithm , not only in distributed systems but in any communication network, is an essential matter for discussion. Tremendous amount of work are happening in the research community on this Election, because many network protocols are in need of a coordinator process for the smooth running of the system. These socalled Leader or Coordinator processes are responsible for the synchronization of the system. If there is no synchronization, then the entire system would become inconsistent which intern makes the system to lose its reliability. Since all the processes need to interact with the leader process, they all must agree upon who the present leader is. Furthermore, if the leader process crashes, the new leader process should take the charge as early as possible. New leader is one among the currently running processes with the highest process id. In this paper we have presented a modified version of ring algorithm. Our work involves substantial modifications of the existing ring election algorithm and the comparison of message complexity with the original algorithm. Simulation results show that our algorithmminimizes the number of messages being exchanged in electing the coordinator.. }, added-at = {2018-03-26T14:01:02.000+0200}, author = {BeaulahSoundarabai, P and Venugopal, Thriveni J K R and Patnaik, L M}, biburl = {https://www.bibsonomy.org/bibtex/25f05a3642350f150f7c7c644ee368e3f/ijfls}, interhash = {810bbaf21f91ee7b47a00ad7db5e156b}, intrahash = {5f05a3642350f150f7c7c644ee368e3f}, journal = {International Journal of Next-Generation Networks (IJNGN)}, keywords = {Algorithm Complexity Coordinator Distributed Election Message Ring System}, month = {March}, number = 1, pages = {21 - 29}, timestamp = {2018-03-26T14:01:02.000+0200}, title = {AN IMPROVED LEADER ELECTION ALGORITHM FOR DISTRIBUTED SYSTEMS}, url = {http://airccse.org/journal/ijngn/current2013.html}, volume = 5, year = 2013 }