高级检索

    面向“云—边—端”算力系统的计算和传输联合优化方法

    A Computing and Transmission Integrated Optimization Method for Cloud-Edge-End Computing First System

    • 摘要: “云—边—端”资源协同优化是算力网络部署的关键难题之一. 如何有效整合高性能云计算、低延时边缘计算和低成本用户设备等异构算力资源,对于算力网络建设具有重要意义. 基于此,提出了一种面向“云—边—端”算力网络的计算和传输联合优化方案,旨在从应用服务模型、网络状态感知和资源联合优化3方面提供一套系统性解决方案. 首先,根据通用应用服务的特性,改进了传统网络服务的链状表征模型,提出了广义图结构的通用服务模型. 其次,为表征异构网络状态的动态规律,提出了用于建模计算和传输时变负载的双虚拟队列结构. 再次,为降低在大规模算力网络中计算和传输资源联合优化的问题复杂度,提出了一种基于图概念的增广图模型,该模型能够将计算和传输联合优化问题转化为增广图的路由问题,简化了异构资源联合优化问题的形式化表征难度. 为实际解决该问题,设计了基于波利亚重球法(Polyak heavy-ball method)的异构资源协同优化算法,并给出了算法复杂度和相关理论的性能分析. 最后,通过数值仿真和原型系统实验,验证了算法理论性能的正确性,以及在服务效用和资源成本等方面对比同期3种相关解决方案的性能优势.

       

      Abstract: Collaborative optimization of “cloud-edge-end” resource collaboration optimization is one of the key challenges in the deployment of computing power networks. Effectively integrating heterogeneous computing resources, such as high-performance cloud computing, low-latency edge computing, and low-cost user devices, is of great significance for the construction of computing first networks. Based on this, we propose a joint optimization scheme for computing and transmission in “cloud-edge-end” computing first networks, aiming to provide a systematic solution from three aspects: application service model, network state awareness, and resource collaboration optimization. Firstly, according to the characteristics of general application services, the traditional network service chain representation model is improved, and a generalized graph structure-based universal service model is proposed. Secondly, to characterize the dynamic rules of heterogeneous network states, a dual virtual queue structure for modeling time-varying computing and transmission loads is proposed. Thirdly, to reduce the complexity of joint optimization of computing and transmission resources in large-scale computing first networks, an augmented graph model based on graph concepts is proposed. This model can transform the joint optimization problem of computing and transmission into a routing problem of the augmented graph, simplifying the formal representation difficulty of heterogeneous resource joint optimization problems. To solve this problem in practice, a heterogeneous resource collaboration optimization algorithm based on the Polyak Heavy-Ball Method is designed, and the algorithm complexity and related theoretical performance analysis are provided. Finally, through numerical simulations and prototype system experiments, the correctness of the algorithm's theoretical performance is verified, as well as the performance advantages in terms of service utility and resource cost compared to three contemporary relevant solutions.

       

    /

    返回文章
    返回