Research Article

Cost-Efficient Allocation of Additional Resources for the Service Placement Problem in Next-Generation Internet

Algorithm 3

UI-AAR.
(1) Locate the most sensitive node using Algorithm 1
(2) if    then
(3)   Add only CPU capacity into using Algorithm 4
(4) else if    then
(5)   Add only Bandwidth capacity into using Algorithm 5
(6) else
(7)   Add both CPU and bandwidth capacity into using Algorithm 6
(8) end if