期刊
IEEE INTERNET OF THINGS JOURNAL
卷 7, 期 5, 页码 4317-4328出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/JIOT.2019.2958400
关键词
Task analysis; Real-time systems; Internet of Things; Resource management; Quality of service; Particle swarm optimization; Cloud computing; Accelerated particle swarm optimization (APSO) technique; application offloading; delay-sensitive application; fog computing; Internet of Things (IoT); multiobjective optimization
资金
- European Union's Horizon 2020 Research and Innovation Programme [825040]
- Estonian Centre of Excellence in IT - European Regional Development Fund
- Department of Science and Technology (Science and Engineering Research Board), India [EEQ/2018/000888]
Nowadays, billions of Internet-of-Things devices generate various types of delay-sensitive tasks to process within a limited time frame. By processing the tasks at the network edge using distributed fog devices can efficiently overcome the deficiency of the centralized cloud data center (CDC), i.e., long latency and network congestion. Moreover, to overcome the inefficiency of the local fog devices, i.e., limited processing and storage capabilities, we investigate the collaboration between distributed fog devices and centralized CDC, where the delay-sensitive tasks can preferably be offloaded on the local fog devices, whereas the resource-intensive tasks are offloaded on the resource-rich CDC. However, one of the challenging tasks in the fog-cloud environment is to find a suitable computing device for each real-time task by considering tradeoff between the latency and cost. To meet the above-mentioned challenge, in this article, we introduce an optimal application offloading strategy in the hierarchical fog-cloud environment using the accelerated particle swarm optimization (APSO) technique. The proposed APSO-based strategy finds an optimal computing device (i.e., fog device or cloud server) for each real-time task using multiple quality-of-service parameters, namely, cost and resource utilization (RU). The performance of the proposed algorithm is evaluated using four different real-time data sets with various performance matrices. The experimental results indicate that the proposed strategy outperforms the existing schemes in terms of average delay, computation time, RU, and average cost by 18%, 21%, 27%, and 23%, respectively.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据