Multi-Objective Optimization-Oriented Resource Allocation in the Fog Environment: A New Hybrid Approach

Multi-Objective Optimization-Oriented Resource Allocation in the Fog Environment: A New Hybrid Approach

Sonti Harika, B. Chaitanya Krishna
DOI: 10.4018/IJITWE.297969
Article PDF Download
Open access articles are freely available for download

Abstract

Fog computing is a decentralized computer system where data, processing, storage, as well as applications are located anywhere between the cloud and data source. Fog computing takes the cloud closer to users, decreasing the latency and allows the deployment of new delay-sensitive appliances. An important feature of a fog-cloud network is the process of decision-making on assigning the resources to execute the tasks of application. This paper aims to propose a resource allocation strategy for fog computing that determines the effective process under the consideration of the objectives that includes the constraints like credibility score, concurrency, price affordability and task time computation. Moreover, the credibility score is determined based on the execution efficiency, Service response rate, access reliability and Reboot rate. Thereby, the optimal allocation of resources is handled by a new Hybrid Monarch-Dragon Algorithm (HM-DA) that hybrids the concept of Dragonfly Algorithm (DA) and Monarch Butterfly Optimization (MBO) algorithm.
Article Preview
Top

1. Introduction

Fog computing (Ghobaei-Arani, et al., 2019; Bellendorf and Mann, 2020; Alemneh, et al., 2020; Li, 2020; Shen, et al., 2020; Das, et al., 2020) is a promising approach that brings cloud computing, storage, and networking services closer to the end-user. This technology benefiting many industries such as manufacturing, e-health, education, oil and gas, smart cities, smart homes, and smart grids. It processes data as well as real-time applications at the edge to reduce latency, however, it is higher in cloud computing (Abdulkareem, 2019; Zheng, et al., 2019; Kim, et al., 2020; Khayer, et al., 2020) since it requires high bandwidth and remote processing. Even cloud and fog offer similar resources and services, fog computing is characterized by low latency with wider dispersed and geographically distributed nodes.

In a fog computing environment, resource selection strategy becomes a complex task due to the heterogeneous resources, dynamic nature of resources, and other environmental requirements (Nguyen, et al., 2019) as well. Moreover, it is an extremely challenging task when user expectations are contradictory and application requirements are expanded. The various fog resource allocation and scheduling solutions can only be more practicable if they are tested using an appropriate task model. So, building an appropriate task model in a fog computing environment has been a major concern and needs to be addressed. Resource allocation and selection in a fog environment fall under the class of Multi-Criteria Decision Making (MCDM) problems (Chen, et al., 2019; Jie, et al., 2019; Li, et al., 2019; Abedin, et al., 2019). In several fog applications and storing data services, the complicated work can be partitioned into several cooperative subtasks with complicated relations and communications, such as interdependencies, concurrency, conflicts, and substitution, among others. Furthermore, price cost and execution time are important to these subtasks. In addition, fog computing infrastructure requires extensive research to solve many challenges such as QoS, efficient resource utilization, deadlock, task scheduling, and dynamic resource management (Hu and Li, 2009; Chen, et al., 2019). In contrast, optimization methods are good for minimizing the total execution time of a task and also solve the other existing challenges.

Complete Article List

Search this Journal:
Reset
Volume 19: 1 Issue (2024)
Volume 18: 1 Issue (2023)
Volume 17: 4 Issues (2022): 1 Released, 3 Forthcoming
Volume 16: 4 Issues (2021)
Volume 15: 4 Issues (2020)
Volume 14: 4 Issues (2019)
Volume 13: 4 Issues (2018)
Volume 12: 4 Issues (2017)
Volume 11: 4 Issues (2016)
Volume 10: 4 Issues (2015)
Volume 9: 4 Issues (2014)
Volume 8: 4 Issues (2013)
Volume 7: 4 Issues (2012)
Volume 6: 4 Issues (2011)
Volume 5: 4 Issues (2010)
Volume 4: 4 Issues (2009)
Volume 3: 4 Issues (2008)
Volume 2: 4 Issues (2007)
Volume 1: 4 Issues (2006)
View Complete Journal Contents Listing