Title: Decentralised priority-based shortest job first queue model for IoT gateways in fog computing

Authors: N. Jayashree; B. Sathish Babu; Basavaraj Talwar

Addresses: Department of Computer Science and Engineering, C. Byregowda Institute of Technology, Kolar, Karnataka, India ' Department of Computer Science and Engineering, RV College of Engineering, Bengaluru, Karnataka, India ' Department of Computer Science and Engineering, National Institute of Technology, Surathkal, Karnataka, India

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.

Keywords: queuing model; IoT; fog computing; M/M/c queues; M/M/c/1 queues; processing time; offload; fog nodes; deadlines; throughput; service time; service rate; latency.

DOI: 10.1504/IJGUC.2022.125148

International Journal of Grid and Utility Computing, 2022 Vol.13 No.4, pp.414 - 424

Received: 23 Dec 2020
Accepted: 20 Mar 2021
Published online: 31 Aug 2022 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article