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

dc.contributor.authorJayashree, N.
dc.contributor.authorBabu, B.S.
dc.contributor.authorTalawar, B.
dc.date.accessioned2026-02-04T12:28:27Z
dc.date.issued2022
dc.description.abstractAn 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.
dc.identifier.citationInternational Journal of Grid and Utility Computing, 2022, 13, 4, pp. 414-424
dc.identifier.issn1741847X
dc.identifier.urihttps://doi.org/10.1504/ijguc.2022.125148
dc.identifier.urihttps://idr.nitk.ac.in/handle/123456789/22760
dc.publisherInderscience Publishers
dc.subjectFog
dc.subjectInternet of things
dc.subjectQueueing theory
dc.subjectDeadline
dc.subjectFog node
dc.subjectIoT
dc.subjectLatency
dc.subjectM/M/c queue
dc.subjectM/M/c/1 queue
dc.subjectOffload
dc.subjectProcessing time
dc.subjectQueuing models
dc.subjectService rates
dc.subjectService time
dc.subjectFog computing
dc.titleDecentralised priority-based shortest job first queue model for IoT gateways in fog computing

Files

Collections