Priority-Based Dynamic Resource Allocation Scheme in Network Slicing

Haneul Ko; Jaewook Lee; Sangheon Pack

doi:10.1109/ICOIN50884.2021.9333944

Priority-Based Dynamic Resource Allocation Scheme in Network Slicing

Haneul Ko
, Jaewook Lee
, Sangheon Pack

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

19 Citations (Scopus)

Abstract

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.

Original language	English
Title of host publication	35th International Conference on Information Networking, ICOIN 2021
Publisher	IEEE Computer Society
Pages	62-64
Number of pages	3
ISBN (Electronic)	9781728191003
DOIs	https://doi.org/10.1109/ICOIN50884.2021.9333944
Publication status	Published - 2021 Jan 13
Event	35th International Conference on Information Networking, ICOIN 2021 - Jeju Island, Korea, Republic of Duration: 2021 Jan 13 → 2021 Jan 16

Publication series

Name	International Conference on Information Networking
Volume	2021-January
ISSN (Print)	1976-7684

Conference

Conference	35th International Conference on Information Networking, ICOIN 2021
Country/Territory	Korea, Republic of
City	Jeju Island
Period	21/1/13 → 21/1/16

Bibliographical note

Publisher Copyright:
© 2021 IEEE.

Keywords

Network slicing
constrained Markov decision process (CMDP)
quality of service (QoS)
resource allocation

ASJC Scopus subject areas

Computer Networks and Communications
Information Systems

Access to Document

10.1109/ICOIN50884.2021.9333944

Cite this

Priority-Based Dynamic Resource Allocation Scheme in Network Slicing. / Ko, Haneul; Lee, Jaewook; Pack, Sangheon.
35th International Conference on Information Networking, ICOIN 2021. IEEE Computer Society, 2021. p. 62-64 9333944 (International Conference on Information Networking; Vol. 2021-January).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Ko, H, Lee, J & Pack, S 2021, Priority-Based Dynamic Resource Allocation Scheme in Network Slicing. in 35th International Conference on Information Networking, ICOIN 2021., 9333944, International Conference on Information Networking, vol. 2021-January, IEEE Computer Society, pp. 62-64, 35th International Conference on Information Networking, ICOIN 2021, Jeju Island, Korea, Republic of, 21/1/13. https://doi.org/10.1109/ICOIN50884.2021.9333944

@inproceedings{897c583aaca340158f9d4f27d6e74c16,

title = "Priority-Based Dynamic Resource Allocation Scheme in Network Slicing",

abstract = "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.",

keywords = "Network slicing, constrained Markov decision process (CMDP), quality of service (QoS), resource allocation",

author = "Haneul Ko and Jaewook Lee and Sangheon Pack",

note = "Publisher Copyright: {\textcopyright} 2021 IEEE.; 35th International Conference on Information Networking, ICOIN 2021 ; Conference date: 13-01-2021 Through 16-01-2021",

year = "2021",

month = jan,

day = "13",

doi = "10.1109/ICOIN50884.2021.9333944",

language = "English",

series = "International Conference on Information Networking",

publisher = "IEEE Computer Society",

pages = "62--64",

booktitle = "35th International Conference on Information Networking, ICOIN 2021",

}

TY - GEN

T1 - Priority-Based Dynamic Resource Allocation Scheme in Network Slicing

AU - Ko, Haneul

AU - Lee, Jaewook

AU - Pack, Sangheon

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 - https://www.scopus.com/pages/publications/85100729843

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 -

Priority-Based Dynamic Resource Allocation Scheme in Network Slicing

Abstract

Publication series

Conference

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this