Towards Priority VM Placement in Fog Networks

Recently, fog computing has emerged as a solution to reduce congestion in the network. By situating computational nodes in close proximity to the end-user, fog computing enhances Quality of Service (QoS). However, the number of jobs and services is numerous, placing significant demand on fog nodes which inherently possess limited capacity. Therefore, it is crucial to discuss the design of a system where critical jobs are given priority over normal jobs while avoiding normal jobs starvation. In this paper, we study the applicability of existing scheduling algorithms to address this challenge. Our findings reveal that existing algorithms fall short in adequately addressing the placement of critical jobs without compromising their QoS. Consequently, we encourage the development of a custom-built algorithm tailored to ensure the allocation of resources for critical jobs while safeguarding the delay requirements of normal jobs.