Improved bully election algorithm for distributed systems

Electing a leader is a classical problem in distributed computing system. Synchronization between processes often requires one process acting as a coordinator. If an elected leader node fails, the other nodes of the system need to elect another leader without much wasting of time. The bully algorithm is a classical approach for electing a leader in a synchronous distributed computing system, which is used to determine the process with highest priority number as the coordinator. In this paper, we have discussed the limitations of Bully algorithm and proposed a simple and efficient method for the Bully algorithm which reduces the number of messages during the election. Our analytical simulation shows that, our proposed algorithm is more efficient than the Bully algorithm with fewer messages passing and fewer stages

An Enhanced Bully Algorithm for Electing a Coordinator in Distributed Systems

In a distributed system for accomplishing a large complex task, the task is divided into subtask and distributed among processes and coordination among processes done via message passing. To make proper coordination and functioning we need a leader node or coordinator node which acts as a centralized control node. Leader election is the most challenging task in distributed system because it is not necessary that leader node is always same because of crash failure or out of service may occur in the system. Tremendous algorithms have been proposed for elect the new leader. These algorithms use a different technique to elect a leader in distributed system. Bully election algorithm is one of the traditional algorithms for electing a leader, in which the highest node Id is elected as a leader but this algorithm requires lots of message passing for electing a leader that imposes heavy network traffic. Due to heavy network traffic, it creates complexity in message passing and takes more time. In this paper, we introduce a new approach which overcomes the drawback of existing Bully election algorithm. Our proposed algorithm is an enhanced version of Bully election algorithm. Our analytical result shows that our algorithm is more efficient than original Bully Algorithm

A Hybrid of Improved Bulls and Weighted Round Robin to optimize the Leader and Load Balancing in Cloud and Distributed Computing Environment

Day by Day there is increase of internet users which leads to increase the traffic in the network which causing the generation of huge data. It requires the balancing of network load on the network servers with different Load balancing techniques. It is also required to have efficient algorithm to analysis the huge data in distributed manner to identify the leader to act as centralized point of contact for services. If we audit on the heap adjusting systems, there are a few potential outcomes to upgrade the methods. In the present scenario, we have the methods, round robin algorithm (static load adjusting), Weighted Round Robin algorithm and Least Load algorithm (Dynamic Load Balancing). A researcher D. Chitra Devi .et .al has given the idea of enhanced weighted round robin algorithm (EWRR) which gives much better reaction when contrasted with basic round robin calculation. Another scholar Rashmi Saini et. al recommended the half breed of round robin calculation and minimum Load Algorithm. From the above scholars� articles, I hereby propose a resolution by improved Bulls algorithm along with Weighted Round Robin (WRR) algorithm to achieve high performance in Distributed and Cloud Computing domain in terms of leader election from a group of distributed and non-failed processes, load balancing dynamically and coordinate other nodes. Bulls algorithm uses the following message types: � Election Message: Sent to announce election. � Answer (Alive) Message: Responds to the Election message. � Coordinator (Victory) Message: Sent by winner of the election to announce victory. When coordinator fails to recover a process P, from failure or detecting before failure, the process P performs the following actions: 1. If P has the highest process id, it sends a Victory message to all other processes and becomes the new Coordinator. Otherwise, P broadcasts an Election message to all other processes with higher process IDs than itself. 2. If P does not receive any Election message, then it broadcasts a Victory message to all other processes and becomes the Coordinator. 3. If P receives an Answer from a process with a higher ID, it sends no further messages for this election and waits for a Victory message. When there is no Victory message after a stipulated period, it restarts the process from the beginning. 4. If P receives an Election message from another process with a lower ID it sends an Answer message back and starts the election process at the beginning, by sending an Election message to higher-numbered processes. 5. If P receives a Coordinator message, it treats the sender as the coordinator

Synchronization Algorithms for Multi-cores and Multiprocessors

A distributed system is a group of processors that do not allocate memory. As an alternative, each processor has its own local memory, and the processors communicate with one another through communication lines such as local-area or wide-area networks. The processors in a distributed system vary in size and function. Such systems may include small handheld or real-time devices, personal computers, workstations, and large mainframe computer systems. Distributed systems, will have their own set of unique challenges, including synchronizing data and creating sense of conflicts. Effective synchronization algorithms performance depends on runtime factors that are rigid to predict. The designers have protocols to employ the synchronization operation and waiting mechanisms to wait for synchronization delays. In this paper an effort is made to investigate synchronization algorithm that vigorously select waiting mechanisms and protocols in response to runtime factors so as to attain enhanced performance. DOI: 10.17762/ijritcc2321-8169.150615

Energy Proficient and Security Protocol for WSN: AODV

Wireless sensor network is extensively used technology now a day in real time application. It consists of a number of autonomous sensor nodes which are organized in various areas of interest to accumulate data and jointly convey that data back to a base station. But the sensor node has limited battery energy and it is also found that the WSN more vulnerable to severe kinds of security threats such as denial of service (DOS), Sybil, hello flood attack etc. In this, we proposed group communication using election algorithm to make the network most energy efficient and also make the network secure. The simulation of the proposed methodology is done between different network parameter such as PDR, end-to-end delay, throughput and energy consumption using the network simulator NS-2.34

An improved leader election algorithm for distributed systems

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.