Abstract

Fog Computing is today a wide used paradigm that allows to distribute the computation in a geographic area. This not only makes possible to implement time-critical applications but opens the study to a series of solutions which permit to smartly organise the traffic among a set of Fog nodes, which constitute the core of the Fog Computing paradigm. A typical smart city setting is subject to a continuous change of traffic conditions, a node that was saturated can become almost completely unloaded and this creates the need of designing an algorithm which allows to meet the strict deadlines of the tasks but at the same time it can choose the best scheduling policy according to the current load situation that can vary at any time. In this paper, we use a Reinforcement Learning approach to design such an algorithm starting from the power-of-random choice paradigm, used as a baseline. By showing results from our delay-based simulator, we demonstrate how such distributed reinforcement learning approach is able to maximise the rate of the tasks executed within the deadline in a way that is equal to every node, both in a fixed load condition and in a real geographic scenario.

Citation

Proietti Mattia, G., & Beraldi, R. (2022). On real-time scheduling in Fog computing: A Reinforcement Learning algorithm with application to smart cities. 2022 IEEE International Conference on Pervasive Computing and Communications Workshops and Other Affiliated Events (PerCom Workshops), 187–193. https://doi.org/10.1109/PerComWorkshops53856.2022.9767498

@inproceedings{2022ProiettiMattiaOnRealtime,
  author = {{Proietti Mattia}, Gabriele and Beraldi, Roberto},
  booktitle = {2022 IEEE International Conference on Pervasive Computing and Communications Workshops and other Affiliated Events (PerCom Workshops)},
  title = {On real-time scheduling in Fog computing: A Reinforcement Learning algorithm with application to smart cities},
  year = {2022},
  volume = {},
  number = {},
  pages = {187-193},
  doi = {10.1109/PerComWorkshops53856.2022.9767498}
}