2018
DOI: 10.1109/access.2018.2871506
|View full text |Cite
|
Sign up to set email alerts
|

Multi-Service Resource Allocation in Future Network With Wireless Virtualization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
24
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
6
1
1

Relationship

2
6

Authors

Journals

citations
Cited by 16 publications
(24 citation statements)
references
References 28 publications
0
24
0
Order By: Relevance
“…We solve the two problems P 1 and P 2 that are still the convex optimization problem. Combining Algorithm 1, we get u 1 , N (1) k , p (1) k and greater than 0.005 sec. When there is a higher delay requirement of D k,max ≤ 0.003 sec, the URLLC slice is more reliable when using the JPSA algorithm, and its overall reliability is higher than the EPA and ESA algorithms.…”
Section: End Ifmentioning
confidence: 96%
See 1 more Smart Citation
“…We solve the two problems P 1 and P 2 that are still the convex optimization problem. Combining Algorithm 1, we get u 1 , N (1) k , p (1) k and greater than 0.005 sec. When there is a higher delay requirement of D k,max ≤ 0.003 sec, the URLLC slice is more reliable when using the JPSA algorithm, and its overall reliability is higher than the EPA and ESA algorithms.…”
Section: End Ifmentioning
confidence: 96%
“…e mobile Internet and the IoT tend to be the main forces to drive the development of mobile communication in the future network. In particular, the equipment of massive IoT that connected to sensors such as humidity sensors and remote industrial robots needs to provide divergent services [1]. For the multiservice requirement of vertical industries in the 5th generation (5G), the one-size-fits-all design concept is not viable anymore, and it is a promising approach to meet the requirement that slicing one physical network into several logical networks according to different demands [2].…”
Section: Introductionmentioning
confidence: 99%
“…(2) We assume the packet whose delay is larger than its maximum time delay will be dropped. The delay utility should decrease rapidly when delay increases and approaches the maximum time delay [31].…”
Section: ) Utility Design and Dynamic Time-slot Allocation Strategy mentioning
confidence: 99%
“…• The packet with a larger delay than the upper delay limit should be dropped. The delay utility should decrease rapidly as delay increases and approaches the upper delay limit [37].…”
Section: B Utility Designmentioning
confidence: 99%
“…There are 200 services on-going at the first timeslot. New services arrival processes are modeled as Poisson distributed with average arrival rate λ. Packets of ongoing services arrive every 100 ms on average and the packet sizes are normally distributed with the means of 500k bits [37]. The duration time of services follows the exponential distribution with mean θ = 1 minute.…”
Section: A System Parametersmentioning
confidence: 99%