An improved multi-objective genetic algorithm with heuristic initialization for service placement and load distribution in edge computing

Edge Computing (EC) is a promising concept to overcome some obstacles of traditional cloud data centers to support Internet of Things (IoT) applications, especially time-sensitive applications. However, EC faces some challenges, including the resource allocation for heterogeneous applications at a n...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computer networks (Amsterdam, Netherlands : 1999) Ročník 194; s. 108146
Hlavní autoři: Maia, Adyson M., Ghamri-Doudane, Yacine, Vieira, Dario, Franklin de Castro, Miguel
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 20.07.2021
Elsevier Sequoia S.A
Elsevier
Témata:
ISSN:1389-1286, 1872-7069
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Edge Computing (EC) is a promising concept to overcome some obstacles of traditional cloud data centers to support Internet of Things (IoT) applications, especially time-sensitive applications. However, EC faces some challenges, including the resource allocation for heterogeneous applications at a network edge composed of distributed and resource-restricted nodes. A relevant issue that needs to be addressed by a resource manager is the service placement problem, which is the decision-making process of determining where to place different services (or applications). A related issue of service placement is how to distribute workloads of an application placed on multiple locations. Hence, we jointly investigate the load distribution and placement of IoT applications to minimize Service Level Agreement (SLA) violations due to the limitations of EC resources and other conflicting objectives. In order to handle the computational complexity of the formulated problem, we propose a multi-objective genetic algorithm with the initial population based on random and heuristic solutions to obtain near-optimal solutions. Evaluation results show that our proposal outperforms other benchmark algorithms in terms of response deadline violation, as well as terms of other conflicting objectives, such as operational cost and service availability.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1389-1286
1872-7069
DOI:10.1016/j.comnet.2021.108146