Telecommunications Science ›› 2019, Vol. 35 ›› Issue (11): 36-50.doi: 10.11959/j.issn.1000-0801.2019275

• research and development • Previous Articles     Next Articles

Multi-constrained trusted cooperative task migration strategy for edge computing

Guangxue YUE1,2,Yasheng DAI2,Xiaohui YANG2,Youkang ZHU2,Zhenxu YOU2,Jiansheng LIU2   

  1. 1 School of Mathematics and Information Engineering,Jiaxing University,Jiaxing 314000,China
    2 School of Science,Jiangxi University of Science and Technology,Ganzhou 341100,China
  • Revised:2019-06-05 Online:2019-11-01 Published:2019-12-23
  • Supported by:
    The National Natural Science Foundation of China(61462036);The National Natural Science Foundation of Zhejiang Province of China(LY16F020028)


In order to guarantee the quality of service of edge computing,a trusted cooperative task distribution strategy for edge computing under multi-dimensional constraints was proposed.The strategy was based on the task requirements,and the edge computing collaborative service leader node organizes the coordinated service alliance members.The priority of cooperative service alliance was determined based on the K-dimension weight index of user task migration.Using the load balancing of the members as the adaptive function,the task allocation and dispatch of alliance members were performed by greedy algorithm.The backup node was selected based on routing piggyback,and the priority of migration was evaluated.The scheduling and migration of collaborative services in case of abnormal collaborative services were realized,which improved the quality of service of edge computing task migration and ensured the reliability of task migration.The simulation results show that the mechanism can effectively complete the task distribution and migration scheduling,improve the collaborative efficiency of edge computing,and guarantee the quality of network service.

Key words: edge computing, task scheduling, multi-constrained optimize, load balancing

CLC Number: 

No Suggested Reading articles found!