Skip to main navigation
Skip to search
Skip to main content
Korea University Pure Home
Search content at Korea University Pure
Home
Profiles
Research units
Equipment
Research output
Press/Media
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
Link opens in a new tab
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Priority-Based Dynamic Resource Allocation Scheme in Network Slicing'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Quality of Service
100%
Dynamic Resource Allocation
100%
Priority-based
100%
Resource Allocation Scheme
100%
Network Slicing
100%
Optimal Allocation
33%
Evaluation Results
33%
Resource Utilization
33%
Resource Management
33%
Linear Programming
33%
Optimal Policy
33%
Management Agent
33%
Demand Profile
33%
Ultra-reliable Low-latency Communication (URLLC)
33%
Constrained Markov Decision Process
33%
Priority Profile
33%
Computer Science
Quality of Service
100%
Resource Allocation Scheme
100%
Dynamic Resource Allocation
100%
Network Slicing
100%
Optimal Allocation
33%
Evaluation Result
33%
Markov Decision Process
33%
Process Problem
33%
Communication Latency
33%
Management Agent
33%
Allocation Policy
33%
Insufficient Resource
33%
Linear Programming
33%
Mathematics
Optimal Policy
100%
Markov Decision Process
100%
Total Amount
100%
Linear Programming
100%
Engineering
Quality of Service
100%
Allocation
100%
Optimal Policy
33%
Resource Usage
33%
Optimal Allocation
33%
Demand Profile
33%
Linear Programming
33%
Markov Decision Process
33%
Earth and Planetary Sciences
Resource Allocation
100%
Decision Process
33%
Decision Making
33%