您当前的位置：
首页 >
文章列表页 >
Network slicing resource allocation algorithm based on bipartite graph matching in smart grids
Papers | 更新时间：2024-05-31

    • Network slicing resource allocation algorithm based on bipartite graph matching in smart grids

    • Journal on Communications   Vol. 45, Issue 3, Pages: 17-28(2024)

    • DOI：10.11959/j.issn.1000-436x.2024055    

      CLC： TN92

    • Online First：2024-03，

      Published：25 March 2024

    移动端阅览

  • Weiwei XIA, Yifei XIN, Dong LIANG, et al. Network slicing resource allocation algorithm based on bipartite graph matching in smart grids[J]. Journal on Communications, 2024, 45(3): 17-28. DOI： 10.11959/j.issn.1000-436x.2024055.

  •  
  •  

0

Views

786

下载量

0

CSCD

Alert me when the article has been cited
提交
Tools
Download
Export Citation
Share
Add to favorites
Add to my album

Related Articles

Cellular-free RAN slicing resource allocation algorithm based on multi-timescale collaboration
Network slicing resource allocation strategy based on joint optimization
Dual time scale network slicing algorithm based on D3QN for B5G multi-service scenarios
Adaptive Resource Scheduling for 5G-R Network Slicing in High-Speed Railways
Joint power and spectrum optimization algorithm for ICV in diverse service scenarios

Related Author

XIA Weiwei
WANG Boye
XIA Yaxing
MIAO Weiwei
WANG Dayang
JING Dongsheng
YAN Feng
SHEN Lianfeng

Related Institution

National Mobile Communications Research Laboratory, Southeast University
Information & Telecommunication Branch, State Grid Jiangsu Electric Power Co., Ltd.
State Grid Suzhou Power Supply Company
School of Physics and Electronic Information, Anhui Normal University
Anhui Provincial Engineering Laboratory on Information Fusion and Control of Intelligent Robot
0