A DISTRIBUTED RING ALGORITHM FOR COORDINATOR ELECTION IN DISTRIBUTED SYSTEMS
Journal: ICTACT Journal on Communication Technology (IJCT) (Vol.7, No. 3)Publication Date: 2016-09-01
Authors : Shaik Naseera;
Page : 1341-1344
Keywords : Leader Election; Concurrent Processing; Clustering; Distributed Environment;
Abstract
In distributed systems, nodes are connected at different geographical locations. As a part of effective resource utilization, the data and resources are shared among these nodes. A leader or pioneer is necessary to take care of this resource sharing process by eliminating conflicting among the nodes. The shared resources are to be accessed in a fair and optimal manner among all the nodes in the network. This makes the importance of electing a leader which can coordinate with all the nodes and make fair use of resources among the nodes. As nodes are distributed in different geographical locations and factors influencing its operation make it inevitable that a leader may go down temporarily or permanently. In such case a new leader has to be elected for coordination. The time taken to elect a new leader is one of the crucial factors in improving the performance of the system. In this paper, we propose a new approach for leader election to optimize the time taken for the nodes to elect the leader.
Other Latest Articles
- ANDROID BASED TELEOPERATION FOR THE FINCH ROBOT
- Call for papers for issue 4-2016
- Modern weapons and military equipment for issue 4-2016
- Modern weapons and military equipment for issue 4-2016
- Application of nuclear magnetic resonance in medicine and its influence on the quality of life and work environment
Last modified: 2016-10-25 13:34:08