International Journal of Advanced Science and Engineering Research
For Queries/Clarification
alameenpublications@gmail.com
e-ISSN 2455-9288
alameenpublications@gmail.com
e-ISSN 2455-9288
ijaser
IJASER publishes high-quality, original research papers, brief reports, and critical reviews in all theoretical, technological, and interdisciplinary studies that make up the fields of advanced science and engineering and its applications.
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 algorithm minimizes the number of messages being exchanged in electing the coordinator..
[1] Sung-Hoon Park, “A Stable Election Protocol based on an Unreliable Failure Detector in Distributed Systems”, Proceedings of IEEE Eighth International Conference on Information Technology: New Generations, pp. 976-984, 2011.
[2] Sandipan Basu, “An Efficient Approach of Election Algorithm in Distributed Systems”, Indian Journal of Computer Science and Engineering (IJCSE), vol. 2, No. 1, pp. 16-21.March 2011.
[3] Muhammad Mahbubur Rahman, Afroza Nahar , “Modified Bully Algorithm using Election Commission”, MASAUM Journal of Computing(MJC),Vol.1 No.3,pp.439-446,October 2009, ISSN 2076-0833.
[4] Chang-Young Kim, Sung-Hoon Bauk, “ The Election Protocol for Reconfigurable Distributed Systems”
, ICWN, pp. 295-301, 2006.
[5] M. S. Kordafshari, M. Gholipour, M.Jahanshahi, A.T. Haghighat, “Modified Bully Election Algorithm In Distributed System”, Wseas Conferences, Cancun, Mexico, May 11-14, 2005.
[6] Sepehri M , Goodarzi M , “Leader Election Algorithm Using Heap Structure”, Proceedings Of The 12th Wseas International Conference On Computers(Iccomp'08), 2008.
[7] Cuibo Yu, Xuerong Gou, Chunhong Zhang, Yang Ji, “Supernode Election Algorithm In P2p Network Based Upon District Partition”, Dcta: International Journal Of Digital Content Technology And Its Applications, Vol. 5, No. 1, Pp. 186 -194, 2011.
[8] Ben Ari, “Principles Of Concurrent And Distributed Programming”, Pearson Education, 2nd Edition, 2006.
[9] H. Garcia-Molina, “Elections in Distributed Computing System”, IEEE Transaction Computer, Vol. C- 310, pp. 48- 59, 1982.
[10] Andrew S and Tanenbaum, “Distributed Systems Principles and Paradigms”, Beijing: Tsinghua University Press, pp.190–192, 2008.
-->