Media Ali Ibrahim

Media Ali Ibrahim

Auto-generated profile, based on publicly available information

Media Ali Ibrahim

Department of Information System Engineering, Erbil Polytechnic University, Erbil, Iraq

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 November 2023 in IEEE Access
Verified
Journal Article
Open access
MIMedia Ali Ibrahim
Media Ali Ibrahim
SAshavan askar
shavan askar
Fog computing (FC) has recently emerged as a promising new paradigm that provides resource-intensive Internet of Things (IoT) applications with low-latency services at the network edge. However, the limited capacity of computing resources in fog colonies pose great challenges for scheduling and allocating application tasks. In this paper, we propose an intelligent scheduling strategy algorithm in a FC system based on multi-Objective Deep Reinforcement learning (MODRL) to select nodes for task processing (fog nodes or cloud) based on three objectives: node current load, node distance, and task priority. The proposed model addresses two main problems: task allocation and task scheduling. We employ three Deep Reinforcement Learning (DRL) agents based on deep Q network (DQN), one for each objective. However, this is a more challenging scenario because there is a trade-off among these objectives, and eventually, each algorithm may select different processing nodes according to its own objective, which brings us to a Pareto Front problem. To solve this problem, we propose using a multi-objective optimization; multi-objective evolutionary algorithm based on decomposition (MOEA/D), and non-dominated sorting genetic algorithm (NSGA2), which are multi-objective optimization algorithm that can choose the optimal node while considering three objectives. The simulation results show that our proposed intelligent scheduling strategy could achieve better outcomes for the various employed performance, efficiency, and adaptability metrics: task completion time, makespan, queueing delay, propagation delay, transmission delay, processing delay, computational delay, latency, CPU load, and storage utilization, with an average value of 2.02ms, 10ms,2ms, 9.9ms, 25ms, 1.0ms, 3.5ms, %10, and % 99, respectively, compared with the existing related research studies.