Load balancing aware scheduling algorithms for fog networks

Fog networks have attracted the attention of researchers recently. The idea is that a part of the computation of a job/application can be performed by fog devices that are located at the network edge, close to the users. Executing latency sensitive applications on the cloud may not be feasible, owing to the significant communication delay involved between the user and the cloud data center (cdc). By the time the application traverses the network and reaches the cloud data center, it might already be too late. However, fog devices, also known as mobile data centers (mdcs), are capable of executing such latency sensitive applications. In this paper, we study the problem of balancing the application load while taking account of security constraints of jobs, across variousmdcsin a fog network. In case a particularmdcdoes not have sufficient capacity to execute a job, the job needs to be migrated to some othermdc. To this end, we propose three heuristic algorithms:minimum distance, minimum load, and minimum hop distance and load (MHDL). In addition, we also propose anILP-based algorithm calledload balancing aware scheduling ILP(LASILP) for solving the task mapping and scheduling problem. The performance of the proposed algorithms have been compared with the cloud only algorithm and another heuristic algorithm called fog-cloud-placement (FCP). Simulation results performed on real-life workload traces reveal that theMHDLheuristic performs better as compared to other scheduling policies in the fog computing environment while meeting application privacy requirements.