多维资源约束下数字孪生边缘部署方法

Digital twin edge deployment with multi-dimension resource constraints

数字孪生技术通过物理设备与虚拟设备间实时信息交互,可实现对物理设备的故障诊断、远程运维和远程优化。数字孪生的云端部署场景下的虚实信息交互时延制约着数字孪生实时类业务性能。将数字孪生体部署在边缘网络中,为降低虚实信息交互时延提供了可行途径。然而边缘服务器有限的存储、计算等资源制约了数字孪生最优边缘部署策略的求解。文中考虑了物理设备与其数字孪生体之间的交互时延、不同物理设备之间的交互时延以及边缘服务器资源约束,建立了数字孪生边缘部署问题模型,并将问题描述为整数规划问题,进而提出了基于分支定界算法和匹配理论的数字孪生边缘部署算法。仿真结果表明,所提出的算法可以在快速的时间内获得有效的边缘部署方案。

Digital twin technology enables troubleshooting,remote operation and remote optimization of physical devices through real-time information interaction between physical and virtual devices.The latency of virtual-real information interaction in the cloud deployment of digital twin limits the performance of digital twin real-time services.Deploying digital twins in the edge network can provide a feasible way to reduce the latency of virtual and real information interaction.However,the limited storage and computation resources of edge servers impede the efforts of finding the solution of the optimal edge deployment strategy for digital twins.In this paper,we consider the interaction latency between physical devices and their digital twins,the interaction latency between different physical devices and the resource constraints of edge servers,and establish a model of the digital twin edge deployment problem.We describe the problem as an integer programming problem,and then propose a digital twin edge deployment algorithm based on branch-and-bound algorithm and matching theory.Simulation results show that the proposed algorithm can rapidly obtain an effective edge deployment solution.