TY - JOUR
T1 - FoGMatch
T2 - An Intelligent Multi-Criteria IoT-Fog Scheduling Approach Using Game Theory
AU - Arisdakessian, Sarhad
AU - Wahab, Omar Abdel
AU - Mourad, Azzam
AU - Otrok, Hadi
AU - Kara, Nadjia
N1 - Funding Information:
Manuscript received December 31, 2019; revised April 18, 2020; accepted May 1, 2020; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor H. Shen. Date of publication June 5, 2020; date of current version August 18, 2020. This work was supported by the Lebanese American University. (Corresponding author: Azzam Mourad.) Sarhad Arisdakessian and Azzam Mourad are with the Department of Computer Science and Mathematics, Lebanese American University, Beirut 1102 2801, Lebanon (e-mail: [email protected]; [email protected]).
Publisher Copyright:
© 1993-2012 IEEE.
PY - 2020/8
Y1 - 2020/8
N2 - Cloud computing has long been the main backbone that Internet of Things (IoT) devices rely on to accommodate their storage and analytical needs. However, the fact that cloud systems are often located quite far from the IoT devices and the emergence of delay-critical IoT applications urged the need for extending the cloud architecture to support delay-critical services. Given that fog nodes possess low resource capabilities compared to the cloud, matching the IoT services to appropriate fog nodes while guaranteeing minimal delay for IoT services and efficient resource utilization on fog nodes becomes quite challenging. In this context, the main limitation of existing approaches is addressing the scheduling problem from one side perspective, i.e., either fog nodes or IoT devices. To address this problem, we propose in this paper a multi-criteria intelligent IoT-Fog scheduling approach using game theory. Our solution consists of designing (1) preference functions for the IoT and fog layers to enable them to rank each other based on several criteria latency and resource utilization and (2) centralized and distributed intelligent scheduling algorithms that capitalize on matching theory and consider the preferences of both parties. Simulation results reveal that our solution outperforms the two common Min-Min and Max-Min scheduling approaches in terms of IoT services execution makespan and fog nodes resource consolidation efficiency.
AB - Cloud computing has long been the main backbone that Internet of Things (IoT) devices rely on to accommodate their storage and analytical needs. However, the fact that cloud systems are often located quite far from the IoT devices and the emergence of delay-critical IoT applications urged the need for extending the cloud architecture to support delay-critical services. Given that fog nodes possess low resource capabilities compared to the cloud, matching the IoT services to appropriate fog nodes while guaranteeing minimal delay for IoT services and efficient resource utilization on fog nodes becomes quite challenging. In this context, the main limitation of existing approaches is addressing the scheduling problem from one side perspective, i.e., either fog nodes or IoT devices. To address this problem, we propose in this paper a multi-criteria intelligent IoT-Fog scheduling approach using game theory. Our solution consists of designing (1) preference functions for the IoT and fog layers to enable them to rank each other based on several criteria latency and resource utilization and (2) centralized and distributed intelligent scheduling algorithms that capitalize on matching theory and consider the preferences of both parties. Simulation results reveal that our solution outperforms the two common Min-Min and Max-Min scheduling approaches in terms of IoT services execution makespan and fog nodes resource consolidation efficiency.
KW - cloud computing
KW - edge computing
KW - fog computing
KW - game theory
KW - intelligent scheduling
KW - Internet of Things
UR - http://www.scopus.com/inward/record.url?scp=85090768645&partnerID=8YFLogxK
U2 - 10.1109/TNET.2020.2994015
DO - 10.1109/TNET.2020.2994015
M3 - Article
AN - SCOPUS:85090768645
SN - 1063-6692
VL - 28
SP - 1779
EP - 1789
JO - IEEE/ACM Transactions on Networking
JF - IEEE/ACM Transactions on Networking
IS - 4
M1 - 9109632
ER -