In this paper, we consider a load balancing protocol based on the power of random choices that is adapted to a fog deploy in which several independent fog nodes equipped with a set of servers or VM are serving the same geographical area. The protocol is based on a simple but effective mechanism based on a threshold of $T$. When a fog node receives a unit of computation or a job, it immediately executes the job if the number of its occupied servers is lower than $T$, otherwise the node executes a randomized algorithm by probing $F$ other fog nodes in the area, and delegates the execution of the job to the least loaded one, provided the workload is lower than the probing node. Through a mathematical analysis we show that probing just one node ($F = 1$) when there are less than two VM free provides the same performance of the well known power-of-two random choices centralized algorithm, but at a much lower delay and control overhead costs. Also, simulations are used to address the node heterogeneity and, with a real testbed, we offer results that prove the effective benefit of the proposed solution in practical applications.

Power of random choices made efficient for fog computing / Beraldi, R.; Proietti Mattia, G.. - In: IEEE TRANSACTIONS ON CLOUD COMPUTING. - ISSN 2168-7161. - 10:2(2022), pp. 1130-1141. [10.1109/TCC.2020.2968443]

Power of random choices made efficient for fog computing

Beraldi R.
Primo
;
Proietti Mattia G.
Secondo
2022

Abstract

In this paper, we consider a load balancing protocol based on the power of random choices that is adapted to a fog deploy in which several independent fog nodes equipped with a set of servers or VM are serving the same geographical area. The protocol is based on a simple but effective mechanism based on a threshold of $T$. When a fog node receives a unit of computation or a job, it immediately executes the job if the number of its occupied servers is lower than $T$, otherwise the node executes a randomized algorithm by probing $F$ other fog nodes in the area, and delegates the execution of the job to the least loaded one, provided the workload is lower than the probing node. Through a mathematical analysis we show that probing just one node ($F = 1$) when there are less than two VM free provides the same performance of the well known power-of-two random choices centralized algorithm, but at a much lower delay and control overhead costs. Also, simulations are used to address the node heterogeneity and, with a real testbed, we offer results that prove the effective benefit of the proposed solution in practical applications.
File allegati a questo prodotto
File Dimensione Formato  
Beraldi_postprint_Power-of-random_2020.pdf

accesso aperto

Note: https://ieeexplore.ieee.org/document/8964273
Tipologia: Documento in Post-print (versione successiva alla peer review e accettata per la pubblicazione)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 594.6 kB
Formato Adobe PDF
594.6 kB Adobe PDF Visualizza/Apri PDF
Beraldi_Power_of_Random_2022.pdf

solo gestori archivio

Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 2.24 MB
Formato Adobe PDF
2.24 MB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11573/1363463
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? 2
social impact