Low-Complexity and Multi-Dimensional Resource Allocation for Industrial Network Slicing
To address the time-consuming multi-dimensional slice resource-allocation problem, a low-complexity algorithm based on alternating direction method of multipliers (ADMM) is proposed. This algorithm substantially reduces slice delay violation rate with less data in shorter time.
Authors
- Danshi Wang (ORCID: https://orcid.org/0000-0001-9815-4013)
- Yonghan Wu (ORCID: https://orcid.org/0000-0002-6897-4675)
- Min Zhang (ORCID: https://orcid.org/0000-0002-2225-8024)
- Jin Li (ORCID: https://orcid.org/0000-0003-3340-1516)
- Wendi Zhao
Institutions
- Beijing University of Posts and Telecommunications (CN)
Publication Details
- Published
- 2024-11-02
- DOI
- https://doi.org/10.1109/acp/ipoc63121.2024.10810001
- Primary Topic
- Software-Defined Networks and 5G
- Type
- article
- Field-Weighted Citation Impact
- 0.00