Abstract

In this paper, we propose and report a study of a low latency resource sharing protocol for Fog Computing. The protocol has its root in the power-of-random choices family of randomization protocol. The protocol, dubbed LLg(T) is designed to cope with a not homogeneous set of nodes and dealing with a communication latency comparable with the task execution, a characteristic of time-constrained applications supported by this service delivery model. Through mathematical analysis and preliminary numerical study, we show that this protocol is suitable for achieving high performance.

Citation

Beraldi, R., & Proietti Mattia, G. (2019, October). A randomized low latency resource sharing algorithm for Fog Computing. 2019 IEEE/ACM 23rd International Symposium on Distributed Simulation and Real Time Applications (DS-RT) (DS-RT’19). https://doi.org/10.1109/DS-RT47707.2019.8958709

@inproceedings{2019BeraldiRandomized,
  author = {Beraldi, Roberto and {Proietti Mattia}, Gabriele},
  title = {A randomized low latency resource sharing algorithm for Fog Computing},
  year = {2019},
  month = oct,
  booktitle = {2019 IEEE/ACM 23rd International Symposium on Distributed Simulation and Real Time Applications (DS-RT) (DS-RT'19)},
  address = {Cosenza, Italy},
  doi = {10.1109/DS-RT47707.2019.8958709},
  url = {https://ieeexplore.ieee.org/abstract/document/8958709},
  days = {6}
}