Fault-Tolerant Fog Computing Models in the IoT

Author(s):  
Ryuji Oma ◽  
Shigenari Nakamura ◽  
Dilawaer Duolikun ◽  
Tomoya Enokido ◽  
Makoto Takizawa
2020 ◽  
Vol 11 (4) ◽  
pp. 72-91
Author(s):  
Ryuji Oma ◽  
Shigenari Nakamura ◽  
Tomoya Enokido ◽  
Makoto Takizawa

In the Fog Comput$ing (FC) model of the Internet of Things (IoT), application processes to handle sensor data are distributed to fog nodes and servers. In the Tree-based FC (TBFC) model proposed by the authors, fog nodes are hierarchically structured. In this article, the authors propose a TBFC for a General Process (TBFCG) model to recover from the faults of fog nodes. If a node gets faulty, the child nodes are disconnected. The authors propose Minimum Energy in the TBFCG tree (MET) and selecting Multiple Parents for recovery in the TBFCG tree (MPT) algorithms to select a new parent node for the disconnected nodes. A new parent node has to process data from not only the disconnected nodes, but also its own child nodes. In the evaluation, the energy consumption and execution time of a new parent node can be reduced by the proposed algorithms.


Author(s):  
Pei Yun Zhang ◽  
Yu Tong Chen ◽  
Meng Chu Zhou ◽  
Ge Xu ◽  
Wen Jun Huang ◽  
...  

2019 ◽  
Vol 20 (2) ◽  
pp. 433-456 ◽  
Author(s):  
Simar Preet Singh ◽  
Anand Nayyar ◽  
Harpreet Kaur ◽  
Ashu Singla

The fog computing models are getting popular as the demand and capacity of data processing is rising for the various applications every year. The fog computing models incorporate the various task scheduling algorithms for the resource selection among the given list of virtual machines (VMs). The task scheduling models are designed around the various task metrics, which include the task length (time), energy, processing cost etc. for the various purposes. The cost oriented scheduling models are primarily built for the customer's perspectives, and saves them a handful amount of money by efficiently assigning the resources for the tasks. In this paper, we have worked upon the multiple task scheduling models based upon the Local Regression (LR), Inter Quartile Range (IQR), Local Regression Robust (LRR), Non-Power Aware (NPA), Median Absolute Deviation (MAD), Dynamic Voltage and Frequency Scheduling (DVFS) and The Static Threshold (THR) methods using the ifogsim simulation designed with the 50 nodes and 50 virtual machines, i.e. 1 virtual machine per node. All of the models have been implemented using the standard input simulation parameters for the purpose of performance assessment in the various domains, specifically in the time domain and effective consumption of energy. The results obtained from the experiments have shown the overall time of 86,400 seconds during the simulation, where the DVFS has been recorded with the 52.98 kWh consumption of energy, which shows the efficient processing in comparison to the 150.68 kWh of energy consumption in the NPA model. Also, there are no SLA violations recorded during both of the simulation, because no VM migration model has been utilized among both of the implemented models, which clearly shows that the VM migrations are the major cause of SLA violation cases. The LRR (2520 VMs) has been observed as best contender on the basis of mean of number of VM migrations in comparison with LR (2555 VMs), THR (4769 VMs), MAD (5138 VMs) and IQR (5352 VMs).


2020 ◽  
Vol 7 (1) ◽  
pp. 263-273 ◽  
Author(s):  
Kun Wang ◽  
Yun Shao ◽  
Lei Xie ◽  
Jie Wu ◽  
Song Guo

Sign in / Sign up

Export Citation Format

Share Document