Towards cost-efficient resource provisioning with multiple mobile users in fog computing

2020 ◽  
Vol 146 ◽  
pp. 96-106
Author(s):  
Shuaibing Lu ◽  
Jie Wu ◽  
Yubin Duan ◽  
Ning Wang ◽  
Juan Fang
2020 ◽  
Vol 10 (18) ◽  
pp. 6494
Author(s):  
MeSuk Kim ◽  
ALam Han ◽  
TaeYoung Kim ◽  
JongBeom Lim

Because the Internet of things (IoT) and fog computing are prevalent, an efficient resource consolidation scheme in nanoscale computing environments is urgently needed. In nanoscale environments, a great many small devices collaborate to achieve a predefined goal. The representative case would be the edge cloud, where small computing servers are deployed close to the cloud users to enhance the responsiveness and reduce turnaround time. In this paper, we propose an intelligent and cost-efficient resource consolidation algorithm in nanoscale computing environments. The proposed algorithm is designed to predict nanoscale devices’ scheduling decisions and perform the resource consolidation that reconfigures cloud resources dynamically when needed without interrupting and disconnecting the cloud user. Because of the large number of nanoscale devices in the system, we developed an efficient resource consolidation algorithm in terms of complexity and employed the hidden Markov model to predict the devices’ scheduling decision. The performance evaluation shows that our resource consolidation algorithm is effective for predicting the devices’ scheduling decisions and efficiency in terms of overhead cost and complexity.


2021 ◽  
Vol 14 (4) ◽  
pp. 94-106
Author(s):  
Pushpa Singh ◽  
Rajeev Agrawal

Fog computing is used to enrich the ability of cloud computing applications. Fog is a kind of buffer area placed between the data processing location and the data storage equipment in the network and plays a significant role in processing the real time data. The lack of resource provisioning approaches and high demand for IoT services make the fog node overloaded. Load balancing is a method to realize efficient resource utilization to avoid bottlenecks, overload, and fog node failure. This study suggests a concept to compute the probabilistic overloading state of a fog node and identification of fog node for load sharing. Each fog node computes Fstate and sends the message at regular intervals to the fog node coordinator (FNC). FNC maintains a fog that is utilized for offloading in case of fog overloading. A comparative study shows that the proposed model avoids an overloading state by the transfer of a certain number of requests to an underloaded fog node before actual overloading occurs. Numerical results validate theoretical investigation and efficiency of the proposed study.


Sign in / Sign up

Export Citation Format

Share Document