Abstract
AbstractFog computing aims to mitigate data communication delay by deploying fog nodes to provide servers in the proximity of users and offload resource-hungry tasks that would otherwise be sent to distant cloud servers. In this paper, we propose an effective fog device deployment algorithm based on a new metaheuristic algorithm–search economics–to solve the optimization problem for the deployment of fog computing systems. The term “effective” in this paper refers to that the developed algorithm can achieve better performance in terms of metrics such as lower latency and less resource usage. Compared with conventional metaheuristic algorithms, the proposed algorithm is unique in that it first divides the solution space into a set of regions to increase search diversity of the search and then allocates different computational resources to each region according to its potential. To verify the effectiveness of the proposed algorithm, we compare it with several classical fog computing deployment algorithms. The simulation results indicate that the proposed algorithm provides lower network latency and higher quality of service than the other deployment algorithms evaluated in this study.
Funder
Ministry of Science and Technology, Taiwan
Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Software
Reference26 articles.
1. Bonomi F, Milito R, Zhu J, Addepalli S (2012) Fog computing and its role in the internet of things. In: Proceedings of Mobile Cloud Computing Workshop. ACM, pp 13–16
2. Hu P, Dhelim S, Ning H, Qiu T (2017) Survey on fog computing: Architecture, key technologies, applications and open issues. J Netw Comput Appl 98:27–42
3. Luan TH, Gao L, Li Z, Xiang Y, Sun L (2015) Fog computing: Focusing on mobile users at the edge. arXiv 1–11. http://arxiv.org/abs/1502.01815
4. Hong CH, Varghese B (2019) Resource management in fog/edge computing: A survey on architectures, infrastructure, and algorithms. ACM Comput Surv 52(5):1–37
5. Aditya S, Figueiredo JR (2017) Frugal: Building degree-constrained overlay topology from social graphs. In: Proceedings of IEEE International Conference on Fog and Edge Computing. IEEE, pp 11–20