2018
DOI: 10.1007/978-981-13-1927-3_31
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Load Balancing Algorithm for Task Preprocessing in Fog Computing Environment

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
13
0
1

Year Published

2020
2020
2022
2022

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 31 publications
(20 citation statements)
references
References 11 publications
0
13
0
1
Order By: Relevance
“…The computing capacity of the cloud data centre is 120,000 MIPS, and the uplink and downlink bandwidth are 2 and 1.9 Mbps, respectively. To better verify the feasibility and performance of the improved algorithm proposed in this study, under the same conditions, the improved chaotic firefly optimisation algorithm is compared with the classic load balancing algorithms such as hill clipping load balancing algorithm [16], load balancing algorithm [17], ISCM [10]. Contrast experiments were carried out.…”
Section: Methodsmentioning
confidence: 99%
“…The computing capacity of the cloud data centre is 120,000 MIPS, and the uplink and downlink bandwidth are 2 and 1.9 Mbps, respectively. To better verify the feasibility and performance of the improved algorithm proposed in this study, under the same conditions, the improved chaotic firefly optimisation algorithm is compared with the classic load balancing algorithms such as hill clipping load balancing algorithm [16], load balancing algorithm [17], ISCM [10]. Contrast experiments were carried out.…”
Section: Methodsmentioning
confidence: 99%
“…ELBA—Efficient Load Balancing Algorithm: The min-min algorithm is implemented in the fog where fog nodes are divided in clusters and the algorithm determines the task which has minimum enforcement time and appoints it a particular node. That node is able to process it in a faster manner [ 39 ]. When a cluster is busy, the controller node inspects neighborhood clusters that contain ’inactive’ fog nodes and sends activity to the node which presents lowest latency.…”
Section: Classification Of Resource Management Algorithms Applied mentioning
confidence: 99%
“…It could be effective to process the activity in the cloud or, instead, leave it to have a delay due to pre-processing at the fog nodes. In another situation, where two or more neighboring ’inactive’ nodes are accessible, the node with the smallest latency can transmit the job activity [ 39 ]. Two factors need to be deliberated to calculate latency: one refers to the number of stand-by requests that need to be supplied in the clusters and the other refers to the inactive node’s distance from the task originator.…”
Section: Classification Of Resource Management Algorithms Applied mentioning
confidence: 99%
See 1 more Smart Citation
“…FC is not meant to compete with cloud computing but boost and strengthen cloud computing efficacy [58]. Low latency, mobility, position awareness, scalability, security, and interaction with heterogeneous devices are supported by this technology [59].…”
Section: E Fog Computingmentioning
confidence: 99%