Exploiting power-of-choices for load balancing in fog computing

Roberto Beraldi, Hussein Alnuweiri

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Power-of-random choices is a well-known phenomenon exploited in load balancing algorithms to achieve an extraordinary improvement at low cost. These algorithms are particularly suitable for the Fog computing model, since they don't require coordination among different fog nodes when they decide to mutually share their resources. In this paper, we propose LL(F, T ) a power-of-random choices based distributed peer-to-peer load balancing algorithm running on a set of autonomous cooperating fog nodes, where F is the protocol fan-out and T a threshold. Nodes implement a random choice over F fog nodes when their current load is above T. Through a mathematical analysis and preliminary simulations we show that tuning T very close to the node saturation condition, this algorithm achieves practically the same performance of its classical implementation requiring a single global scheduler, without the need for each and every job execution to be preceded by a time costly probing phase, a clear benefit for the low delay requirement of fog applications.

Original languageEnglish
Title of host publicationProceedings - 2019 IEEE International Conference on Fog Computing, ICFC 2019
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages80-86
Number of pages7
ISBN (Electronic)9781728132365
DOIs
Publication statusPublished - 1 Jun 2019
Event1st IEEE International Conference on Fog Computing, ICFC 2019 - Prague, Czech Republic
Duration: 24 Jun 201926 Jun 2019

Publication series

NameProceedings - 2019 IEEE International Conference on Fog Computing, ICFC 2019

Conference

Conference1st IEEE International Conference on Fog Computing, ICFC 2019
CountryCzech Republic
CityPrague
Period24/6/1926/6/19

Fingerprint

Fog
Resource allocation
Fans
Tuning
Node
Load balancing
Costs

Keywords

  • Load balancing
  • Randomized algorithms

ASJC Scopus subject areas

  • Information Systems and Management
  • Safety, Risk, Reliability and Quality
  • Computer Networks and Communications
  • Hardware and Architecture

Cite this

Beraldi, R., & Alnuweiri, H. (2019). Exploiting power-of-choices for load balancing in fog computing. In Proceedings - 2019 IEEE International Conference on Fog Computing, ICFC 2019 (pp. 80-86). [8821996] (Proceedings - 2019 IEEE International Conference on Fog Computing, ICFC 2019). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICFC.2019.00019

Exploiting power-of-choices for load balancing in fog computing. / Beraldi, Roberto; Alnuweiri, Hussein.

Proceedings - 2019 IEEE International Conference on Fog Computing, ICFC 2019. Institute of Electrical and Electronics Engineers Inc., 2019. p. 80-86 8821996 (Proceedings - 2019 IEEE International Conference on Fog Computing, ICFC 2019).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Beraldi, R & Alnuweiri, H 2019, Exploiting power-of-choices for load balancing in fog computing. in Proceedings - 2019 IEEE International Conference on Fog Computing, ICFC 2019., 8821996, Proceedings - 2019 IEEE International Conference on Fog Computing, ICFC 2019, Institute of Electrical and Electronics Engineers Inc., pp. 80-86, 1st IEEE International Conference on Fog Computing, ICFC 2019, Prague, Czech Republic, 24/6/19. https://doi.org/10.1109/ICFC.2019.00019
Beraldi R, Alnuweiri H. Exploiting power-of-choices for load balancing in fog computing. In Proceedings - 2019 IEEE International Conference on Fog Computing, ICFC 2019. Institute of Electrical and Electronics Engineers Inc. 2019. p. 80-86. 8821996. (Proceedings - 2019 IEEE International Conference on Fog Computing, ICFC 2019). https://doi.org/10.1109/ICFC.2019.00019
Beraldi, Roberto ; Alnuweiri, Hussein. / Exploiting power-of-choices for load balancing in fog computing. Proceedings - 2019 IEEE International Conference on Fog Computing, ICFC 2019. Institute of Electrical and Electronics Engineers Inc., 2019. pp. 80-86 (Proceedings - 2019 IEEE International Conference on Fog Computing, ICFC 2019).
@inproceedings{dfe465d8e91b4de7a6464cad446b0857,
title = "Exploiting power-of-choices for load balancing in fog computing",
abstract = "Power-of-random choices is a well-known phenomenon exploited in load balancing algorithms to achieve an extraordinary improvement at low cost. These algorithms are particularly suitable for the Fog computing model, since they don't require coordination among different fog nodes when they decide to mutually share their resources. In this paper, we propose LL(F, T ) a power-of-random choices based distributed peer-to-peer load balancing algorithm running on a set of autonomous cooperating fog nodes, where F is the protocol fan-out and T a threshold. Nodes implement a random choice over F fog nodes when their current load is above T. Through a mathematical analysis and preliminary simulations we show that tuning T very close to the node saturation condition, this algorithm achieves practically the same performance of its classical implementation requiring a single global scheduler, without the need for each and every job execution to be preceded by a time costly probing phase, a clear benefit for the low delay requirement of fog applications.",
keywords = "Load balancing, Randomized algorithms",
author = "Roberto Beraldi and Hussein Alnuweiri",
year = "2019",
month = "6",
day = "1",
doi = "10.1109/ICFC.2019.00019",
language = "English",
series = "Proceedings - 2019 IEEE International Conference on Fog Computing, ICFC 2019",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "80--86",
booktitle = "Proceedings - 2019 IEEE International Conference on Fog Computing, ICFC 2019",

}

TY - GEN

T1 - Exploiting power-of-choices for load balancing in fog computing

AU - Beraldi, Roberto

AU - Alnuweiri, Hussein

PY - 2019/6/1

Y1 - 2019/6/1

N2 - Power-of-random choices is a well-known phenomenon exploited in load balancing algorithms to achieve an extraordinary improvement at low cost. These algorithms are particularly suitable for the Fog computing model, since they don't require coordination among different fog nodes when they decide to mutually share their resources. In this paper, we propose LL(F, T ) a power-of-random choices based distributed peer-to-peer load balancing algorithm running on a set of autonomous cooperating fog nodes, where F is the protocol fan-out and T a threshold. Nodes implement a random choice over F fog nodes when their current load is above T. Through a mathematical analysis and preliminary simulations we show that tuning T very close to the node saturation condition, this algorithm achieves practically the same performance of its classical implementation requiring a single global scheduler, without the need for each and every job execution to be preceded by a time costly probing phase, a clear benefit for the low delay requirement of fog applications.

AB - Power-of-random choices is a well-known phenomenon exploited in load balancing algorithms to achieve an extraordinary improvement at low cost. These algorithms are particularly suitable for the Fog computing model, since they don't require coordination among different fog nodes when they decide to mutually share their resources. In this paper, we propose LL(F, T ) a power-of-random choices based distributed peer-to-peer load balancing algorithm running on a set of autonomous cooperating fog nodes, where F is the protocol fan-out and T a threshold. Nodes implement a random choice over F fog nodes when their current load is above T. Through a mathematical analysis and preliminary simulations we show that tuning T very close to the node saturation condition, this algorithm achieves practically the same performance of its classical implementation requiring a single global scheduler, without the need for each and every job execution to be preceded by a time costly probing phase, a clear benefit for the low delay requirement of fog applications.

KW - Load balancing

KW - Randomized algorithms

UR - http://www.scopus.com/inward/record.url?scp=85072940229&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85072940229&partnerID=8YFLogxK

U2 - 10.1109/ICFC.2019.00019

DO - 10.1109/ICFC.2019.00019

M3 - Conference contribution

AN - SCOPUS:85072940229

T3 - Proceedings - 2019 IEEE International Conference on Fog Computing, ICFC 2019

SP - 80

EP - 86

BT - Proceedings - 2019 IEEE International Conference on Fog Computing, ICFC 2019

PB - Institute of Electrical and Electronics Engineers Inc.

ER -