Load balancing techniques for fog computing environment: Comparison, taxonomy, open issues, and challenges

SUMMARY Load balancing (LB) is nothing but the systematic distribution of load over different servers. The fog server is handling the maximum data of the cloud server to enhance the advancement of users' requests. The growth in data requests is escalating, and fog computing has intensified the...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Concurrency and computation 2022-10, Vol.34 (23), p.n/a
Hauptverfasser: Kashyap, Vijaita, Kumar, Ashok
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:SUMMARY Load balancing (LB) is nothing but the systematic distribution of load over different servers. The fog server is handling the maximum data of the cloud server to enhance the advancement of users' requests. The growth in data requests is escalating, and fog computing has intensified the accessibility of the data. Fog computing achieves many challenges according to the demands of the users, but even so, some challenges require more progress. The problem faced by fog computing is LB due to an increase in traffic on the network layer. Various LB techniques have already been proposed in the cloud layer, but until now they have only been in progress in the fog layer. Inefficient LB may cause a decrease in service quality, like delays in response time, processing time, security, and many more. In this survey, several algorithms have been discussed that are based on LB, which works out the issue of overloaded data on the network. Some parameters that authors have focused in LB are latency, bandwidth, deadlines, cost, security, execution time, and response time. Other parameters based on fault tolerance are also discussed with their quality parameter table and algorithm. In addition to this some of the limitations of the author's work, that is discussed in this article.
ISSN:1532-0626
1532-0634
DOI:10.1002/cpe.7183