A highly efficient resource slicing and scheduling optimization algorithm for power heterogeneous communication networks based on hypergraph and congruence entropy

Abstract

Abstract New services, such as distributed photovoltaic regulation and control, pose new service requirements for communication networks in the new power system. These requirements include low latency, high reliability, and large bandwidth. Consequently, power heterogeneous communication networks face the challenge of maintaining quality of service (QoS) while enhancing network resource utilization. Therefore, this paper puts forward a highly efficient optimization algorithm for resource slicing and scheduling in power heterogeneous communication networks. Our first step involves establishing an architectural description model of heterogeneous wireless networks for electric power based on hypergraph. This model characterizes complex dynamic relationships among service requirements, virtual networks, and physical networks. The system congruence entropy characterizes the degree of matching between the service demand and resource supply. Then an optimization problem is formed to maximize the system congruence entropy through dynamic resource allocation. To solve this problem, a joint resource allocation and routing method based on Lagrangian dual decomposition is proposed. These methods provide the optimal solutions of the nodes and link mappings of service function chains. The simulation results demonstrate that the proposed algorithm in this paper can greatly enhance resource utilization and also meet the QoS requirements of various services.

Keywords

• Power system
• Heterogeneous communication networks
• Resource slicing
• Hypergraph
• Congruence entropy