TY - GEN
T1 - Priority-Based Dynamic Resource Allocation Scheme in Network Slicing
AU - Ko, Haneul
AU - Lee, Jaewook
AU - Pack, Sangheon
N1 - Funding Information:
ACKNOWLEDGEMENT This research was supported by National Research Foundation (NRF) of Korea Grant funded by the Korean Government (MSIP) (No. 2019R1C1C1004352).
Publisher Copyright:
© 2021 IEEE.
Copyright:
Copyright 2021 Elsevier B.V., All rights reserved.
PY - 2021/1/13
Y1 - 2021/1/13
N2 - In the network slicing environment, if insufficient resource is allocated to a resource-hungry slice (e.g., ultrareliable low latency communication (URLLC)), its quality of service (QoS) can be significantly degraded. In this paper, we propose a priority-based dynamic resource allocation scheme (PDRAS) where the resource management agent maintains some information such as priorities and demand profiles of slices. Based on these information, the agent dynamically allocates resources to slices. To maximize QoS of slices while maintaining the total amount of allocated resources below a certain level, a constrained Markov decision process (CMDP) problem is formulated and the optimal allocation policy is achieved by linear programming (LP). Extensive evaluation results are given to demonstrate the effectiveness of PDRAS with the optimal policy compared to that of other schemes in terms of QoS and the efficiency of the resource usage.
AB - In the network slicing environment, if insufficient resource is allocated to a resource-hungry slice (e.g., ultrareliable low latency communication (URLLC)), its quality of service (QoS) can be significantly degraded. In this paper, we propose a priority-based dynamic resource allocation scheme (PDRAS) where the resource management agent maintains some information such as priorities and demand profiles of slices. Based on these information, the agent dynamically allocates resources to slices. To maximize QoS of slices while maintaining the total amount of allocated resources below a certain level, a constrained Markov decision process (CMDP) problem is formulated and the optimal allocation policy is achieved by linear programming (LP). Extensive evaluation results are given to demonstrate the effectiveness of PDRAS with the optimal policy compared to that of other schemes in terms of QoS and the efficiency of the resource usage.
KW - Network slicing
KW - constrained Markov decision process (CMDP)
KW - quality of service (QoS)
KW - resource allocation
UR - http://www.scopus.com/inward/record.url?scp=85100729843&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85100729843&partnerID=8YFLogxK
U2 - 10.1109/ICOIN50884.2021.9333944
DO - 10.1109/ICOIN50884.2021.9333944
M3 - Conference contribution
AN - SCOPUS:85100729843
T3 - International Conference on Information Networking
SP - 62
EP - 64
BT - 35th International Conference on Information Networking, ICOIN 2021
PB - IEEE Computer Society
T2 - 35th International Conference on Information Networking, ICOIN 2021
Y2 - 13 January 2021 through 16 January 2021
ER -