Model and Algorithms for the Planning of Fog Computing Networks

Fog computing has risen as a promising technology for augmenting the computational and storage capability of the end devices and edge networks. The urging issues in this networking paradigm are fog nodes planning, resources allocation, and offloading strategies. This paper aims to formulate a mathem...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE internet of things journal Jg. 6; H. 2; S. 3873 - 3884
Hauptverfasser: Zhang, Decheng, Haider, Faisal, St-Hilaire, Marc, Makaya, Christian
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Piscataway IEEE 01.04.2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Classification
Cloud computing
Computation offloading
Computational modeling
Delays
Edge computing
Electronic devices
evolutionary algorithm (EA)
Evolutionary algorithms
Evolutionary computation
fog computing
Genetic algorithms
heuristic
Internet of Things
modular facility location
multiobjective
Multiple objective analysis
network planning
Networks
Pareto optimization
Particle swarm optimization
Performance evaluation
Planning
Sorting algorithms
ISSN:2327-4662, 2327-4662
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Fog computing has risen as a promising technology for augmenting the computational and storage capability of the end devices and edge networks. The urging issues in this networking paradigm are fog nodes planning, resources allocation, and offloading strategies. This paper aims to formulate a mathematical model which jointly tackles these issues. The goal of the model is to optimize the tradeoff (Pareto front) between the capital expenditure and the network delay. To solve this multiobjective optimization problem and obtain benchmark values, we first use the weighted sum method and two existing evolutionary algorithms (EAs), nondominated sorting genetic algorithm II and speed-constrained multiobjective particle swarm optimization. Then, inspired by those EAs, this paper proposes a new EAs, named particle swarm optimized nondominated sorting genetic algorithm, which combines the convergence and searching efficiency of the existing EAs. The effectiveness of the proposed algorithm is evaluated by the hypervolume and inverted generational distance indicators. The performance evaluation results show that the proposed model and algorithms can help the network planners in the deployment of fog networks to complement their existing computation and storage infrastructure.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2327-4662
2327-4662
DOI:10.1109/JIOT.2019.2892940