GWS—A Collaborative Load-Balancing Algorithm for Internet-of-Things

Sensors

Hongyu Xiao¹  Zhenjiang Zhang²  Zhangbing Zhou³ 

[1] Department of Electronic and Information Engineering, Beijing Jiaotong University, Beijing 100044, China;Key Laboratory of Communication and Information Systems, Beijing Municipal Commission of Education, Beijing Jiaotong University, Beijing 100044, China;School of Information Engineering, China University of Geosciences at Beijing, Beijing 100083, China;

关键词: collaborative;    Internet-of-Things;    fog computing;    Nash bargaining solution;    Pareto optimality;    scheduling;    time-sharing;   

DOI  :  10.3390/s18082479

来源: DOAJ

【 摘 要 】

This paper firstly replaces the first-come-first-service (FCFS) mechanism with the time-sharing (TS) mechanism in fog computing nodes (FCNs). Then a collaborative load-balancing algorithm for the TS mechanism is proposed for FCNs. The algorithm is a variant of a work-stealing scheduling algorithm, and is based on the Nash bargaining solution (NBS) for a cooperative game between FCNs. Pareto optimality is achieved through the collaborative working of FCNs to improve the performance of every FCN. Lastly the simulation results demonstrate that the game-theory based work-stealing algorithm (GWS) outperforms the classical work-stealing algorithm (CWS).

【 授权许可】

Unknown