Slicing Resource Allocation for eMBB and URLLC in 5G RAN
Algorithm 2
Joint power and subcarrier allocation (JPSA).
Solve the nonlinear programming problem of the relaxed N in (8a)–(8e) by Algorithm 1, we get l the lower bound of (7) and the initial resource allocation .
While do
If then
Break
Else
Find the upper bound of the problem. Initialize the subcarrier number and the power We determine the feasible solution, and we obtain u as an upper bound of (7).
End if
Branch the problem in (7) into problems with and with by the branch and bound method. We solve the two problems and that are still the convex optimization problem. Combining Algorithm 1, we get and .
