Abstract

Cloud computing provides multiple services such as computational services, data processing, and resource sharing through multiple nodes. These nodes collaborate for all prementioned services in the data center through the head/leader node. This head node is responsible for reliability, higher performance, latency, and deadlock handling and enables the user to access cost-effective computational services. However, the optimal head nodes’ selection is a challenging problem due to consideration of resources such as memory, CPU-MIPS, and bandwidth. The existing methods are monolithic, as they select the head nodes without taking the resources of the nodes. Still, there is a need for the candidate node which can be selected as a head node in case of head node failure. Therefore, in this paper, we proposed a technique, i.e., Head Node Selection Algorithm (HNSA), for optimal head node selection from the data center, which is based on the genetic algorithm (GA). In our proposed method, there are three modules, i.e., initial population generation, head node selection, and candidate node selection. In the first module, we generate the initial population by randomly mapping the task on different servers using a scheduling algorithm. After that, we compute the overall cost and the cost of each node based on resources. In the second module, the best optimal nodes are selected as a head node by applying the genetic operations such as crossover, mutation, and fitness function by considering the available resources. In the selected optimal nodes, one node is chosen as a head node and the other is considered as a candidate node. In the third module, the candidate node becomes the head node in the case of head node failure. The proposed method HNSA is compared against the state-of-the-art algorithms such as Bees Life Algorithm (BLA) and Heterogeneous Earliest Finished Time (HEFT). The simulation analysis shows that the proposed HNSA technique performs better in terms of execution time, memory utilization, service level sgreement (SLA) violation, and energy consumption.

Highlights

  • Introduction e recent advancements inInternet technologies and cloud computing have transformed the way data is processed

  • There is a need for the candidate node which can be selected as a head node in case of head node failure. erefore, in this paper, we proposed a technique, i.e., Head Node Selection Algorithm (HNSA), for optimal head node selection from the data center, which is based on the genetic algorithm (GA)

  • We focused on the problem of the head node selection in the cloud data center

Read more

Summary

Related Work

We have reviewed the existing techniques related to frequent leader/head node selection. Ree empirical techniques were employed in a cohesive way for calculating the proper status of leaders in a polynomial period Another model for leader node selection was introduced in [48] based on employing the probabilistic grounded framework. E method in [49] proposed an approach for the peer-topeer network, while for distributed environment a technique was introduced in [51] employing software mediators to improve the speed of leader election procedure and minimize the energy consumption. Ese approaches do not take into account the network topology and availability of real-time resources before performing the leader node selection procedure [7, 57,58,59,60]. We are presenting a novel approach for the leader/head node selection which is based on the idea of GA

Mutation
Results and Discussion
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call