Main Article Content
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.
How to Cite
, S. L. C. M. V. R. M. . (2018). A Hybrid of Improved Bulls and Weighted Round Robin to optimize the Leader and Load Balancing in Cloud and Distributed Computing Environment. International Journal on Future Revolution in Computer Science &Amp; Communication Engineering, 4(1), 09–16. Retrieved from https://ijfrcsce.org/index.php/ijfrcsce/article/view/956