HBI-LB: A Dependable Fault-Tolerant Load Balancing Approach for Fog based Internet-of-Things Environment

Minimum-Cost-Based Neighbour Node Discovery Scheme for Fault Tolerance under IoT-Fog Networks

“…These earlier studies did not take fault tolerance into account, making them unsuitable for reliability applications. The Honey-Bee-Inspired Load-Balancing (HBI-LB) algorithm was proposed [25] to examine the load-balancing in the IoT-FoG network. Ranjan et al [26] proposed a shortest-path resource allocation algorithm for the optimal allocation of resources in D2D, which could handle multiple users simultaneously.…”

“…The maximum response time, 49.57 ms, occurred at a higher task count of 1500, with a task length of 5000. The proposed method provides shorter response times of 0.9 ms, 0.3 ms, and 0.1 ms for HBI-LB [25], Throttled, and Round Robin [27], respectively. This is because an increase in both factors will directly affect the load of the Fog network and the availability of Fog access nodes during efficient task-offloading, significantly increasing the average response time.…”

“…This is because an increase in both factors will directly affect the load of the Fog network and the availability of Fog access nodes during efficient task-offloading, significantly increasing the average response time. Figure 6a,b present a comparison of average response times with various existing algorithms, such as Round Robin, Throttled [27], and HBI-LB [25], for variable task lengths and multiple tasks, respectively. This is identified as the proposed PTFT algorithm with a shorter average response time of 1 ms, 0.3 ms, and 0.7 ms for HBI-LB [25], Throttled [27], and Round Robin, respectively.…”

“…Figure 6a,b present a comparison of average response times with various existing algorithms, such as Round Robin, Throttled [27], and HBI-LB [25], for variable task lengths and multiple tasks, respectively. This is identified as the proposed PTFT algorithm with a shorter average response time of 1 ms, 0.3 ms, and 0.7 ms for HBI-LB [25], Throttled [27], and Round Robin, respectively.…”

“…Figure 6a,b present a comparison of average response times with various existing algorithms, such as Round Robin, Throttled [27], and HBI-LB [25], for variable task lengths and multiple tasks, respectively. This is identified as the proposed PTFT algorithm with a shorter average response time of 1 ms, 0.3 ms, and 0.7 ms for HBI-LB [25], Throttled [27], and Round Robin, respectively. This is achieved because the lowest-cost path with appropriate residual energy levels are selected based on task priority and the free availability of alternate candidate Fog access nodes for task-offloading following fault occurrence, while also keeping track of task-offloading activities in Fog network using RPF algorithm to avoid the under-and overutilization of Fog access nodes.…”