通信学报2024，Vol.45Issue(3)：17-28,12.DOI:10.11959/j.issn.1000-436x.2024055
智能电网中基于二分图匹配的网络切片资源分配算法
Network slicing resource allocation algorithm based on bipartite graph matching in smart grids
摘要
Abstract
To solve the problem of simultaneously satisfying the quality of service requirements of multiple types of ser-vices in smart grids and considering the economic utility of power terminals and network side,a network slicing resource allocation algorithm based on bipartite graph matching was proposed.For the control and collection services in smart grids,the corresponding bidding information was formulated for the power terminals,and the payment price and utility matrix were calculated accordingly.The resource allocation between the network slices and the power terminals was modeled as a bipartite graph matching problem.Different slicing resources were allocated to the terminals according to the latency,transmission rate,or energy consumption requirements of different services to maximize the system utility.Simulation results show that the proposed algorithm is able to improve the system utility by 10%～20%compared to the existing double auction algorithm and greedy algorithm.关键词
网络切片/资源分配/智能电网/二分图匹配/拍卖Key words
network slicing/resource allocation/smart grid/bipartite graph matching/auction分类
电子信息工程引用本文复制引用
夏玮玮,辛逸飞,梁栋,吴军,王歆,燕锋,沈连丰..智能电网中基于二分图匹配的网络切片资源分配算法[J].通信学报,2024,45(3):17-28,12.基金项目
国家电网有限公司科技基金资助项目(No.520601220022) The Science and Technology Project of State Grid Corporation of China(No.520601220022) （No.520601220022）
