Trinity Equilibrium Algorithm for Computing Network Digital Twin
The integration of Network Digital Twin (NDT) with 6 G and future networks is a burgeoning field, where the optimization of computing resources is paramount. This paper introduces the Trinity Equilibrium Algorithm (TEA), a novel approach to balance the fulfillment of Computing Service Requests (CSRs), the scheduling of Computing Resources (CRs), and the minimization of Energy Consumption (EC) within a Computing Network Digital Twin (CNDT). TEA is designed to maximize overall revenue by considering the operational costs of CNDT and the revenue nature of computing services. The algorithm addresses the inefficiencies of traditional computing resource optimization by integrating NDT capabilities to dynamically adjust to service quality expectations and energy costs. A numerical evaluation demonstrates TEA's superiority over contrast algorithms in generating higher revenue and lower energy consumption across various test scenarios. The findings underscore TEA's potential in enhancing the performance of future networks by optimizing resource allocation and energy efficiency.
Authors
- Ye Ouyang (ORCID: https://orcid.org/0000-0002-6195-6415)
- Shoufeng Wang (ORCID: https://orcid.org/0000-0002-5575-5772)
- Sen Bian
- Limeng Ma (ORCID: https://orcid.org/0000-0002-8479-683X)
- Fan Li (ORCID: https://orcid.org/0000-0002-2400-9021)
- Xuan Chen (ORCID: https://orcid.org/0000-0002-2856-8242)
- Jianchao Guo (ORCID: https://orcid.org/0000-0001-6691-4196)
- Shuling Wang
- Hua‐Min Chen (ORCID: https://orcid.org/0000-0002-2799-6464)
- Zhanwu Li
Institutions
- Beijing University of Technology (CN)
- China United Network Communications Group (China) (CN)
Publication Details
- Published
- 2024-10-18
- DOI
- https://doi.org/10.1109/dtpi61353.2024.10778807
- Primary Topic
- Digital Transformation in Industry
- Type
- article
- Field-Weighted Citation Impact
- 0.00