Drawer Cosine optimization enabled task offloading in fog computing

被引:1
|
作者
Ameena, Bibi [1 ]
Ramasamy, Loganthan [2 ]
机构
[1] Reva Univ, Sch C & IT, Bangalore 560064, Karnataka, India
[2] Sri Venkateshwara Coll Engn, Informat Sci & Engn, Bangalore 562157, Karnataka, India
关键词
Fog computing; Drawer Algorithm; Sine Cosine Algorithm; Drawer Cosine Optimization; Task offloading;
D O I
10.1016/j.eswa.2024.125212
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Fog computing offers the benefit of low-latency computing thereby improving the Quality of Service (QoS) of low-latency applications. Hence, it is essential to distribute the applications in a balanced way across the different fog nodes, however, task offloading remains a challenging issue. Several existing methods are Convenient for task offloading in fog computing, but they are affected by congestion and communication delay. The foremost purpose of this work is to introduce a newly developed scheme for task offloading in fog computing named Drawer Cosine Optimization (DCO) based on multiple objectives such as makespan, cost, load, and energy. Here, DCO is designed by the unification of the Drawer Algorithm (DA) and the Sine Cosine Algorithm (SCA). Initially, the user task computation is performed and then the task is uploaded to the fog node. Every node has a local agent, which is responsible for gathering data like sensor service rate and sensor data arrival rate. But, when the fog cloud resources are constrained, task offloading requests are sent by the sensors to fog nodes, which then forward them to a master node, which is in charge of scheduling offloaded tasks to the fog nodes utilizing DCO. The developed DCO is evaluated using measures, such as load, energy, makespan, time and memory and is revealed to achieve superior values of 0.116, 0.472 J, 0.365, 3.221sec and 7.452 MB, when using task size100.
引用
收藏
页数:14
相关论文
共 50 条
  • [21] An evolutionary game approach to IoT task offloading in fog-cloud computing
    Hamidreza Mahini
    Amir Masoud Rahmani
    Seyyedeh Mobarakeh Mousavirad
    The Journal of Supercomputing, 2021, 77 : 5398 - 5425
  • [22] An evolutionary game approach to IoT task offloading in fog-cloud computing
    Mahini, Hamidreza
    Rahmani, Amir Masoud
    Mousavirad, Seyyedeh Mobarakeh
    JOURNAL OF SUPERCOMPUTING, 2021, 77 (06) : 5398 - 5425
  • [23] Container-based Task Offloading for Time-Critical Fog Computing
    Chebaane, Ahmed
    Spornraft, Simon
    Khelil, Abdelmajid
    2020 IEEE 3RD 5G WORLD FORUM (5GWF), 2020, : 205 - 211
  • [24] A Distributed Algorithm for Task Offloading in Vehicular Networks With Hybrid Fog/Cloud Computing
    Liu, Zongkai
    Dai, Penglin
    Xing, Huanlai
    Yu, Zhaofei
    Zhang, Wei
    IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2022, 52 (07): : 4388 - 4401
  • [25] Clustering-Based Energy Efficient Task Offloading for Sustainable Fog Computing
    Yadav, Anirudh
    Jana, Prasanta K.
    Tiwari, Shashank
    Gaur, Abhay
    IEEE TRANSACTIONS ON SUSTAINABLE COMPUTING, 2023, 8 (01): : 56 - 67
  • [26] Delay Optimization Based on Improved Differential Evolutionary Algorithm for Task Offloading in Fog Computing Networks
    Li, Xujie
    Zhang, Guangzhao
    Zheng, Xuedong
    Hua, Siyang
    2020 12TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS AND SIGNAL PROCESSING (WCSP), 2020, : 109 - 114
  • [27] Task offloading in mobile fog computing by classification and regression tree
    Dadmehr Rahbari
    Mohsen Nickray
    Peer-to-Peer Networking and Applications, 2020, 13 : 104 - 122
  • [28] Task offloading in mobile fog computing by classification and regression tree
    Rahbari, Dadmehr
    Nickray, Mohsen
    PEER-TO-PEER NETWORKING AND APPLICATIONS, 2020, 13 (01) : 104 - 122
  • [29] Dynamic Resource Management and Task Offloading Framework for Fog Computing
    Haitham M. Abdelghany
    Journal of Grid Computing, 2025, 23 (2)
  • [30] Efficient Task Completion for Parallel Offloading in Vehicular Fog Computing
    Xie, Jindou
    Jia, Yunjian
    Chen, Zhengchuan
    Nan, Zhaojun
    Liang, Liang
    CHINA COMMUNICATIONS, 2019, 16 (11) : 42 - 55