The growth of large scale sensing applications (as in the case of smart cities applications) is a main driver of the fog computing paradigm. However, as the load for such fog infrastructures increases, there is a growing need for coordination mechanisms that can provide load balancing. The problem is exacerbated by local overload that may occur due to an uneven distribution of processing tasks (jobs) over the infrastructure, which is typical real application such as smart cities, where the sensor deployment is irregular and the workload intensity can fluctuate due to rush hours and users behavior. In this paper we introduce two load sharing mechanisms that aim to offload jobs towards the neighboring nodes. We evaluate the performance of such algorithms in a realistic environment that is based on a real application for monitoring in a smart city. Our experiments demonstrate that even a simple load balancing scheme is effective in addressing local hot spots that would arise in a non-collaborative fog infrastructure.

A Random Walk based Load Balancing Algorithm for Fog Computing / Beraldi, R.; Canali, C.; Lancellotti, R.; Mattia, G. P.. - (2020), pp. 46-53. ((Intervento presentato al convegno 5th International Conference on Fog and Mobile Edge Computing, FMEC 2020 tenutosi a Paris; France [10.1109/FMEC49853.2020.9144962].

A Random Walk based Load Balancing Algorithm for Fog Computing

Beraldi R.
Primo
;
Mattia G. P.
2020

Abstract

The growth of large scale sensing applications (as in the case of smart cities applications) is a main driver of the fog computing paradigm. However, as the load for such fog infrastructures increases, there is a growing need for coordination mechanisms that can provide load balancing. The problem is exacerbated by local overload that may occur due to an uneven distribution of processing tasks (jobs) over the infrastructure, which is typical real application such as smart cities, where the sensor deployment is irregular and the workload intensity can fluctuate due to rush hours and users behavior. In this paper we introduce two load sharing mechanisms that aim to offload jobs towards the neighboring nodes. We evaluate the performance of such algorithms in a realistic environment that is based on a real application for monitoring in a smart city. Our experiments demonstrate that even a simple load balancing scheme is effective in addressing local hot spots that would arise in a non-collaborative fog infrastructure.
978-1-7281-7216-3
File allegati a questo prodotto
File Dimensione Formato  
Beraldi_postprint_A-Random-Walk_2020.pdf

accesso aperto

Note: DOI: 10.1109/FMEC49853.2020.9144962
Tipologia: Documento in Post-print (versione successiva alla peer review e accettata per la pubblicazione)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 256.07 kB
Formato Adobe PDF
256.07 kB Adobe PDF Visualizza/Apri PDF
Beraldi_A-Random-Walk_2020.pdf

solo gestori archivio

Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 864.83 kB
Formato Adobe PDF
864.83 kB 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/1472216
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 6
  • ???jsp.display-item.citation.isi??? 4
social impact