Head Node Selection Algorithm in Cloud Computing Data Center

Samira Kanwal, Zeshan Iqbal, Aun Irtaza, Muhammad Sajid, Sohaib Manzoor and Nouman Ali

Mathematical Problems in Engineering, 2021, vol. 2021, 1-12

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.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2021/3418483.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2021/3418483.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:3418483

DOI: 10.1155/2021/3418483

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().