Decentralised priority-based shortest job first queue model for IoT gateways in fog computing
No Thumbnail Available
Date
2022
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Inderscience Publishers
Abstract
An increased growth in time-critical IoT applications, led to a rise in real-time resource requirements. The stringent deadlines on latency have made IoT applications move out from far away cloud servers to distributed fog computing devices infrastructure which is available locally. To meet the touchstones of deadlines and processing times, there is a need to prioritise the job scheduling through the IoT gateways to appropriate fog devices. Studies showed that the queuing models exhibit uncertainties in choosing suitable computing devices, applying priorities to the jobs, deadline achievements, and minimum latency constraints. In this paper, we propose a Decentralised Priority-based Shortest Job First (DPSJF) queuing model for the IoT gateways for a fog computing infrastructure, which uses the priority-based jobs sorting technique to achieve better performance and also overcome most of the uncertainties in queuing. © © 2022 Inderscience Enterprises Ltd.
Description
Keywords
Fog, Internet of things, Queueing theory, Deadline, Fog node, IoT, Latency, M/M/c queue, M/M/c/1 queue, Offload, Processing time, Queuing models, Service rates, Service time, Fog computing
Citation
International Journal of Grid and Utility Computing, 2022, 13, 4, pp. 414-424
