边缘计算架构中P2P的组合多资源任务卸载算法  

Combined Multi-Resource Task Offloading Algorithm for P2P in Edge Computing

作　　者：鲁蔚锋 李学晴[1,2] 徐佳 陈思光 LU Weifeng;LI Xueqing;XU Jia;CHEN Siguang(School of Computer Science,Nanjing University of Posts and Telecommunications,Nanjing 210023,China;Jiangsu Key Laboratory of Big Data Security and Intelligent Processing,Nanjing University of Posts and Telecommunications,Nanjing 210023,China;School of Internet of Things,Nanjing University of Posts and Telecommunications,Nanjing 210023,China)

机构地区：[1]南京邮电大学计算机学院、软件学院、网络空间安全学院,南京210023 [2]南京邮电大学江苏省大数据安全与智能处理重点实验室,南京210023 [3]南京邮电大学物联网学院,南京210023

出　　处：《北京邮电大学学报》2022年第4期98-103,共6页Journal of Beijing University of Posts and Telecommunications

基　　金：国家自然科学基金项目(61872193);南京邮电大学科研项目(NY220056)。

摘　　要：为了解决点对点(P2P)系统中多种资源合作完成任务卸载的问题,提出了多资源组合交易卸载算法,设计了激励机制,促使设备加入任务卸载系统,同时保证系统内资源可以被高效地利用。通过严格的理论分析可知,所设计的多资源组合交易机制能满足计算效率可行性和个体理性的要求。通过实验模拟得出结论:提出的多资源组合交易卸载算法的资源交易数量虽然没有达到对比算法下的资源交易数量,但时间复杂度远远低于对比算法。In order to solve the problem of task offloading that requires the cooperation of multiple resources in the peer-to-peer system, a multi-resource combination transaction offloading algorithm is proposed, and an incentive mechanism is designed to encourage devices to join the task offloading system, while ensuring that the resources in the system can be efficiently utilized. Through rigorous theoretical analysis, it is proved that the designed multi-resource combination transaction mechanism satisfies the feasibility of calculation efficiency and individual rationality, and extensive experimental simulations are carried out, although the number of resource transactions of the proposed multi-resource combination transaction offloading algorithm does not reach the number of resource transactions under the comparison algorithm, but the time complexity of the algorithm is far lower than the comparison algorithm.

关 键 词：点对点 任务卸载 资源共享 激励机制 分配算法 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]