Scheduling IoT Requests to Minimize Latency in Fog Computing

Abstract

Delivering services for Internet of Things (IoT) applications that demand real-time and predictable latency is challenge. Several IoT applications require stringent latency requirements due to the interaction between the IoT devices and the physical environment through sensing and actuation. The limited capabilities of IoT devices require applications to be integrated in cloud computing and fog computing paradigms. Fog computing significantly improves on the service latency as it brings resources closer to the edge. The characteristics of both fog and cloud computing will enable the integration and interoperation of a large number of IoT devices and services in different domains. This thesis models the scheduling of IoT service requests as an optimization problem using integer programming in order to minimize the overall service request latency. The scheduling problem by nature is NP-hard, and hence, exact optimization solutions are inadequate for large size problems. Hence, this work uses the genetic algorithm (GA) as a heuristic approach to schedule the IoT requests and achieve the objective of minimizing the overall latency. The GA is tested in a dynamic simulation environment. The performance of the GA is evaluated and compared to the performance of waited-fair queuing (WFQ), priority-strict queuing (PSQ), and round robin (RR) techniques. The results show that the overall latency for the proposed approach is 21.9% to 46.6% better than the other algorithms. The proposed approach also showed significant improvement in meeting the requests deadlines by up to 31%.