Research Article
Service Placement Optimization Based on Evolutionary Algorithm in Fog Computing
@ARTICLE{10.4108/eai.22-2-2022.173492, author={Jiamin Niu and Gang Liu and Lin Yu and Jiawei Wang}, title={Service Placement Optimization Based on Evolutionary Algorithm in Fog Computing}, journal={EAI Endorsed Transactions on Internet of Things}, volume={7}, number={26}, publisher={EAI}, journal_a={IOT}, year={2022}, month={2}, keywords={Fog computing, Fog service placement, Multi-objective optimization, NSGA-II}, doi={10.4108/eai.22-2-2022.173492} }- Jiamin Niu
Gang Liu
Lin Yu
Jiawei Wang
Year: 2022
Service Placement Optimization Based on Evolutionary Algorithm in Fog Computing
IOT
EAI
DOI: 10.4108/eai.22-2-2022.173492
Abstract
As an emerging distributed computing paradigm, fog computing provides low-latency and real-time interactive services to end-user or Internet of Things(IoT) devices at the edge of the network. One of the main challenges of fog computing is to select the right fog node to deploy and run IoT application services, which is commonly referred to as the fog service placement problem (FSPP). However most schemes model FSPP as a single objective optimization problem. These single- objective optimization schemes usually cannot meet the needs of increasingly complex engineering practice. In this study, we model the fog service placement problem as a constrained multi-objective optimization problem, which aims to improve the resource utilization of the system and reduce network latency and service placement costs. Secondly, the elitist nondominated sorting genetic algorithm II (NSGA-II) is used to optimize the constrained multi-objective service placement problem. Experimental results show that the proposed scheme is superior to the existing schemes in terms of overall performance.
Copyright © 2022 Jiamin Niu et al., licensed to EAI. This is an open access article distributed under the terms of the Creative Commons Attribution license, which permits unlimited use, distribution and reproduction in any medium so long as the original work is properly cited.
