Cost Efficient Task Offloading for Delay Sensitive Applications in Fog Computing System

Fog computing has emerged as a promising solution to process tasks and computations generated by end devices. It enhances the quality of service for delay-sensitive applications using low-latency devices like fog to process data instead of a high-latency cloud environment. Thus, it becomes the need...

Full description

Saved in:
Bibliographic Details
Published in:SN computer science 2023-10, Vol.4 (6), p.817, Article 817
Main Authors: Lone, Kalimullah, Sofi, Shabir Ahmad
Format: Article
Language:English
Subjects:
Cloud computing
Computation offloading
Computer Imaging
Computer networks
Computer Science
Computer Systems Organization and Communication Networks
Data Structures and Information Theory
Edge computing
Energy consumption
Information Systems and Communication Service
Internet of Things
Microprocessors
Nodes
Optimization
Original Research
Pattern Recognition and Graphics
Quality of service
Research Trends in Communication and Network Technologies
Robots
Scheduling
Software Engineering/Programming and Operating Systems
Task scheduling
Vision
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Fog computing has emerged as a promising solution to process tasks and computations generated by end devices. It enhances the quality of service for delay-sensitive applications using low-latency devices like fog to process data instead of a high-latency cloud environment. Thus, it becomes the need of the hour to schedule tasks effectively over fog nodes to minimize the overall cost of the system. In this paper, we are proposing a cost-efficient task-offloading method in a fog computing environment. The model uses a gateway to collect information from all the fog nodes and assigns tasks to the fog nodes in an efficient way. The objective of the work is to minimize the overall cost of the system in terms of energy consumption and makespan. The makespan consists of transmission time, processing time, and waiting time. The results obtained from the work are compared with that of the random scheduling and longest job fastest processor methods. The simulation results obtained from the proposed method are found to be superior to the other existing methods. The overall cost of the system is enhanced in an optimized way.
ISSN:2661-8907
2662-995X
2661-8907
DOI:10.1007/s42979-023-02300-3