New Application Task Offloading Algorithms for Edge, Fog, and Cloud Computing Paradigms

In the last few years, we have seen an exponential increase in the number of computation-intensive applications, which have resulted in the popularity of fog and cloud computing paradigms among smart-chip-embedded mobile devices. These devices can partially offload computation tasks either using the...

Full description

Bibliographic Details
Main Author: Sungwook Kim
Format: Article
Language:English
Published: Hindawi-Wiley 2020-01-01
Series:Wireless Communications and Mobile Computing
Online Access:http://dx.doi.org/10.1155/2020/8888074
Description
Summary:In the last few years, we have seen an exponential increase in the number of computation-intensive applications, which have resulted in the popularity of fog and cloud computing paradigms among smart-chip-embedded mobile devices. These devices can partially offload computation tasks either using the fog system or using the cloud system. In this study, we design a new task offloading scheme by considering the challenges of future edge, fog and cloud computing paradigms. To provide an effective solution toward an appropriate task offloading problem, we focus on two cooperative bargaining game solutions—Tempered Aspirations Bargaining Solution (TABS) and Gupta-Livne Bargaining Solution (GLBS). To maximize the application service quality, a proper bargaining solution should be properly selected. In the proposed scheme, the TABS method is used for time-sensitive offloading services, and the GLBS method is applied to ensure computation-oriented offloading services. The primary advantage of our bargaining-based approach is to provide an axiom-based strategic solution for the task offloading problem while dynamically responding to the current network environments. Extensive simulation studies are conducted to demonstrate the effectiveness of the proposed scheme, and the superior performance over existing schemes is observed. Finally, we show prime directions for future work and potential research issues.
ISSN:1530-8669
1530-8677