Internet of Things Applications Placement to Minimize Latency in Multi-tier Fog Computing Framework

Abstract

The application placement strategies in the hierarchical fog-cloud environment based on the directed acyclic graph (DAG) for rapid execution is an NP-hard optimization problem. Although heuristics have been proposed to generate sub-optimal solutions based on non-preemptive placement policy, merging multiple DAG-based applications into one application is simple but ineffective for minimizing the overall makespan due to the lack of consideration of fairness among multiple DAG-based applications. We design an application placement strategy based on dynamic scheduling that can effectively utilize the schedule gaps in the virtual machines of the different layers to minimize the makespan that meets the deadlines.